M. Davis, G. Logemann, and D. Loveland, A machine program for theorem proving, Comm. of the ACM, Vol.5, 394--397, 1962. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Technical Reports on Mathematical and Computing Sciences.. - Title On Unique (Correct)
No context found.
M. Davis, G. Logemann, and D. Loveland, A machine program for theorem proving, Comm. of the ACM, Vol.5, 394--397, 1962.
NiVER: Non Increasing Variable Elimination Resolution.. - Sathiamoorthy.. (Correct)
No context found.
M. Davis, et.al.,: A machine program for theorem proving. Comm. of ACM, 5(7) (1962)
A Fast Pseudo-Boolean Constraint Solver - Chai, Kuehlmann (2003) (7 citations) (Correct)
No context found.
M. Davis, G. Logeman, and D. Loveland, "A machine program for theorem proving, " Communications of the ACM, vol. 5, pp. 394--397, July 1962.
A Fast Pseudo-Boolean Constraint Solver - Chai, Kuehlmann (2005) (7 citations) (Correct)
No context found.
M. Davis, G. Logemann, and D. Loveland, "A machine program for theorem proving," Commun. ACM, vol. 5, pp. 394--397, 1962.
NiVER: Non Increasing Variable Elimination - Resolution For Preprocessing (Correct)
No context found.
M. Davis, et.al.,: A machine program for theorem proving. Comm. of ACM, 5(7) (1962)
Parallel Multithreaded Satisfiability Solver: Design.. - Feldman, Dershowitz.. (2005) (Correct)
No context found.
Martin Davis, George Logemann and Donald W. Loveland. A machine program for theorem proving, Journal of the ACM, 394--397, 1962.
Parallel Multithreaded Satisfiability Solver: Design and.. - Feldman (2005) (Correct)
No context found.
Martin Davis, George Logemann and Donald W. Loveland. A machine program for theorem proving, Journal of the ACM, 394--397, 1962.
Unbounded Model Checking for Knowledge and Time - Kacprzak, Lomuscio, Penczek (2003) (Correct)
No context found.
M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5(7):394--397, 1962.
Verification of Multiagent Systems via Unbounded Model.. - Kacprzak, Lomuscio.. (2004) (Correct)
No context found.
M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5(7):394-- 397, 1962.
Algebraic Simplification Techniques For Propositional.. - de Faria (2001) (Correct)
No context found.
M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Communications of the ACM, 5:394-397, July 1962.
Conflict-directed A* and Its Role in Model-based Embedded.. - Williams, Ragno (Correct)
No context found.
M. Davis, G. Logemann, D. Loveland, A machine program for theorem proving, Communications of the ACM 5 (1962) 394--397.
Facilitating Reuse in Hardware Models - Type (Correct)
No context found.
DAVIS, M., LOGEMANN, G., AND LOVELAND, D. A machine program for theorem-proving. Communications of the ACM 5, 7 (1962), 394--397.
An Efficient Projected Minimal Conflict Generator for Projected.. - Elliott (2004) (Correct)
No context found.
Martin Davis, George Logemann, and Donald Loveland. A machine program for theorem-proving. Commun. ACM, 5(7):394--397, 1962.
Bounded Model Checking for Timed Systems - Audemard, Cimatti, Kornilowicz.. (2002) (9 citations) (Correct)
No context found.
M. Davis, G. Longemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5(7), 1962.
Sat-Based Decision Procedures For Automated Reasoning: A.. - Armando, Al. (2002) (Correct)
No context found.
M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5(7), 1962.
Improved Branch and Bound Algorithms for MAX-SAT - Alsinet, Manya, Planes (2003) (2 citations) (Correct)
No context found.
M. Davis, G. Logemann, and D. Loveland. A machine program for theoremproving. Communications of the ACM, 5:394-397, 1962.
Simple and Minimum-Cost Satisfiability for Goal Models - Sebastiani, Giorgini.. (2004) (Correct)
No context found.
M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5(7), 1962.
Simplification Rules for Constrained Formula Tableaux - Giese (2003) (Correct)
No context found.
M. Davis, G. Logemann, and D. Loveland. A machine program for theoremproving. Communications of the ACM, 5:394--397, 1962.
Complete Search Restart Strategies for Satisfiability - Baptista, Lynce, Marques-Silva (2001) (2 citations) (Correct)
No context found.
M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Communications of the ACM, 5:394-397, July 1962.
NiVER: Non Increasing Variable Elimination Resolution for.. - Subbarayan, Pradhan (2004) (Correct)
No context found.
M. Davis, et.al.,: A machine program for theorem proving. Comm. of ACM, 5(7) (1962)
Centro Per La Ricerca - Scientifica Tecnologica Povo (Correct)
No context found.
M. Davis, G. Longemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5(7), 1962.
Building State-of-the-Art SAT Solvers - Lynce, Marques-Silva (2002) (2 citations) (Correct)
No context found.
M. Davis, G. Logemann, and D. Loveland, `A machine program for theorem-proving', Communications of the Association for Computing Machinery, 5, 394--397, (July 1962).
Unknown - Toby Walsh University (Correct)
No context found.
M. Davis, G. Logemann, and D. Loveland. A machine program for theoremproving. Communications of the ACM, 5:394--397, 1962.
Unbounded Model Checking for Alternating-Time Temporal Logic - Kacprzak, Penczek (2004) (Correct)
No context found.
M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5(7):394-- 397, 1962.
Verification of Multiagent Systems via Unbounded Model.. - Kacprzak, Lomuscio.. (2004) (Correct)
No context found.
M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5(7):394-- 397, 1962.
Local Consistencies in SAT - Bessiere, Hebrard, Walsh (Correct)
No context found.
M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5:394397, 1962.
A SAT-Based Decision Procedure for ALC - Giunchiglia, Sebastiani (1996) (30 citations) (Correct)
No context found.
M. Davis, G. Longemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5(7), 1962.
On Resolution Complexity of Matching Principles - Dantchev (2002) (Correct)
No context found.
M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, (5):394--397, 1962.
TSAT++: an Open Platform for Satisfiability Modulo.. - Armando, Castellini.. (2004) (Correct)
No context found.
M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5(7), 1962.
Improved Branch and Bound Algorithms for - Max-Sat Teresa Alsinet (Correct)
No context found.
M. Davis, G. Logemann, and D. Loveland. A machine program for theoremproving. Communications of the ACM, 5:394-397, 1962.
Conflict-directed A* and Its Role in Model-based Embedded.. - Williams, Ragno (2003) (Correct)
No context found.
M. Davis, G. Logemann, D. Loveland, A machine program for theorem proving, Communications of the ACM 5 (1962) 394--397.
Mv-Satz: A SAT Solver for Many-Valued Clausal Forms - Ansótegui.. (Correct)
No context found.
M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Communications of the ACM, 5:394-397, 1962.
Combining SAT Methods with Non-Clausal Decision Heuristics - Barrett, Donham (2004) (2 citations) (Correct)
No context found.
Martin Davis, George Logemann, and Donald Loveland. A machine program for theorem-proving. Communications of the ACM, 5:394--397, July 1962.
An Efficient Projected Minimal Conflict Generator for Projected.. - Elliott (2004) (Correct)
No context found.
Martin Davis, George Logemann, and Donald Loveland. A machine program for theorem-proving. Commun. ACM, 5(7):394--397, 1962.
Efficient Simplification of SAT Instances from Formal.. - Subbarayan (2004) (Correct)
No context found.
M. Davis, G. Logemann, and D. Loveland. "A machine program for theorem proving". Comm. of ACM, 5(7), 1962
The MathSAT Solver - a progress report (Extended.. - Bozzano, Cimatti.. (2004) (Correct)
No context found.
M. Davis, G. Longemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5(7), 1962.
On Quantified Weighted MAX-SAT - Mali (Correct)
No context found.
M. Davis, G. Logemann and D. Loveland, A machine program for theorem proving, Journal of the ACM, 5(7), 1962.
On Efficiently Integrating Boolean and Theory-Specific Solving.. - Sebastiani (2004) (Correct)
No context found.
M. Davis, G. Longemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5(7), 1962.
Watched Data Structures for QBF Solvers - Gent, Giunchiglia, Narizzano.. (2003) (Correct)
No context found.
Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Journal of the ACM 5 (1962)
Web Explanations For Semantic Heterogeneity Discovery - Shvaiko, al. (2004) (Correct)
No context found.
M. Davis, G. Longemann, and D. Loveland. A machine program for theorem proving. In Journal of the ACM, number 5(7), 1962.
Darwin: A Theorem Prover for the Model Evolution Calculus - Baumgartner, Fuchs, Tinelli (2004) (Correct)
No context found.
Martin Davis, George Logemann, and Donald Loveland. A machine program for theorem proving. Communications of the ACM, 5(7):394--397, July 1962.
Physical Systems for the Solution of Hard Computational Problems - Mattsson (2003) (Correct)
No context found.
Davis M Logemann G and Loveland D, A machine program for theoremproving , Commun. ACM 5 394--397 (1962)
Simple and Minimum-Cost Satisfiability - For Goal Models (Correct)
No context found.
M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5(7), 1962.
Worst-case upper bounds for SAT: automated proof - Nikolenko, Sirotkin (2003) (4 citations) (Correct)
No context found.
M. Davis, G. Logemann, D. Loveland. A machine program for theorem-proving. Communications of the ACM 5(7) (1962), 394-397.
A SAT-Based Propositional Prover for Consistency Checking of.. - Kaiser (2001) (Correct)
No context found.
M. Davis, G. Logemann, and D. Loveland. A machine program for theoremproving. In Communications of the ACM, volume 5, pages 394-397, 1962.
Simplification Rules for Constrained Formula Tableaux - Giese (2003) (Correct)
No context found.
M. Davis, G. Logemann, and D. Loveland. A machine program for theoremproving. Communications of the ACM, 5:394--397, 1962.
A Comparative Study of - Two Boolean Formulations (Correct)
No context found.
M. Davis, G. Longeman, and D. Loveland, "A Machine Program for Theorem Proving," Comm. ACM, vol. 5, no. 7, 1962.
Verification of Proofs of Unsatisfiability for CNF Formulas - Evgueni Goldberg Yakov (2003) (5 citations) (Correct)
No context found.
M.Davis, G.Longemann, D.Loveland. A Machine program for theorem proving. Communications of the ACM. -1962. - V.5. -P.394-397.
A Complete Adaptive Algorithm for Propositional Satisfiability - Bruni, Sassano (2002) (Correct)
No context found.
M. Davis, G. Logemann, and D. Loveland. A machine program for theoremproving. Comm. Assoc. for Comput. Mach. 5 (1962) 394--397.
Solution Learning and Solution Directed Backjumping, Revisited - Gent, Rowley (2004) (Correct)
No context found.
M. Davis, G. Logemann, and D. Loveland, `A machine program for theorem-proving', Commun. ACM, 5(7), 394--397, (1962).
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC