Davis, M., Putnam, H.: (1960) A computing procedure for quantification theory. J. of ACM, 7, 201-215. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Finding New Conjugate-Orthogonal Latin Squares by a.. - Zhang, Bennett (1994) (3 citations) (Correct)
No context found.
Davis, M., Putnam, H.: (1960) A computing procedure for quantification theory. J. of ACM, 7, 201-215.
Technical Reports on Mathematical and Computing Sciences.. - Title On Unique (Correct)
No context found.
M. Davis and H. Putnam, A computing procedure for quantification theory, Journal of the ACM, 7(3), 201--215, 1960.
A Nitpick Analysis of Mobile IPv6 - Jackson, Ng, Wing (1999) (4 citations) (Correct)
No context found.
Davis, M. and Putnam, H.: A computing procedure for quantification theory. Journal of the ACM, Vol. 7, pp. 202--215, 1960.
NiVER: Non Increasing Variable Elimination Resolution.. - Sathiamoorthy.. (Correct)
No context found.
M. Davis, H. Putnam. : A Computing procedure for quantification theory. J. of the ACM,7 (1960)
A Fast Pseudo-Boolean Constraint Solver - Chai, Kuehlmann (2005) (7 citations) (Correct)
No context found.
M. Davis and H. Putnam, "A computing procedure for quantification theory," J. Assoc. Comput. Mach., vol. 7, pp. 102--215, 1960.
Equivalence Checking Combining a Structural SAT-Solver.. - Simulation Viresh Paruthi (2000) (Correct)
No context found.
M. Davis and H. Putnam, "A computing procedure for quantification theory," Journal of the Association of for Computing Machinery, vol. 7, pp. 102--215, 1960.
Sudoku as a SAT Problem - Ines Lynce Ist (Correct)
No context found.
M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the Association for Computing Machinery, 7:201--215, July 1960.
NiVER: Non Increasing Variable Elimination - Resolution For Preprocessing (Correct)
No context found.
M. Davis, H. Putnam. : A Computing procedure for quantification theory. J. of the ACM,7 (1960)
Constraint Propagation - Bessiere (2006) (Correct)
No context found.
M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201--215, 1960.
Parallel Multithreaded Satisfiability Solver: Design.. - Feldman, Dershowitz.. (2005) (Correct)
No context found.
Martin Davis and Hilary Putnam. A computing procedure for quantification theory, Journal of the ACM, 201--215, 1960.
Semantic Knowledge Partitioning - Christoph Wernhard Institut (Correct)
No context found.
M. Davis and H. Putnam. A computing procedure for quantification theory. JACM, 7(3):201--215, 1960.
Parallel Multithreaded Satisfiability Solver: Design and.. - Feldman (2005) (Correct)
No context found.
Martin Davis and Hilary Putnam. A computing procedure for quantification theory, Journal of the ACM, 201--215, 1960.
An Efficient Projected Minimal Conflict Generator for Projected.. - Elliott (2004) (Correct)
No context found.
Martin Davis and Hilary Putnam. A computing procedure for quantification theory. J. ACM, 7(3):201--215, 1960.
Solving Hard Disjunctive Logic Programs Faster - Sometimes Gerald Pfeifer (2003) (Correct)
No context found.
M. Davis and H. Putnam. A Computing Procedure for Quantification Theory. JACM, 7:201--215, 1960.
Bucket Elimination: A Unifying Framework for Probabilistic.. - Dechter (1996) (74 citations) (Correct)
No context found.
M. Davis and H. Putnam, "A computing procedure for quantification theory," Journal of the ACM 7 (1960):201-216.
NiVER: Non Increasing Variable Elimination Resolution for.. - Subbarayan, Pradhan (2004) (Correct)
No context found.
M. Davis, H. Putnam. : A Computing procedure for quantification theory. J. of the ACM,7 (1960)
Mini-Buckets: A General Scheme for Generating Approximations in.. - Dechter (1997) (10 citations) (Correct)
No context found.
M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the Association of Computing Machinery, 7(3), 1960.
Heuristic-Based Backtracking for Propositional.. - Bhalla, Lynce, de.. (Correct)
No context found.
M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the Association for Computing Machinery, 7:201--215, July 1960.
Automating the Synthesis of Decision Procedures in a .. - Armando, Gallagher, .. (1996) (1 citation) (Correct)
No context found.
M. Davis and H. Putnam. A computing procedure for quantification theory. J. Association for Computing Machinery, 7:201--215, 1960.
Building State-of-the-Art SAT Solvers - Lynce, Marques-Silva (2002) (2 citations) (Correct)
No context found.
M. Davis and H. Putnam, `A computing procedure for quantification theory', Journal of the Association for Computing Machinery, 7, 201-- 215, (July 1960).
The Effect of Nogood Recording in DPLL-CBJ SAT Algorithms - Lynce, Marques-Silva (Correct)
No context found.
M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the Association for Computing Machinery, 7:201--215, July 1960.
A SAT-Based Decision Procedure for ALC - Giunchiglia, Sebastiani (1996) (30 citations) (Correct)
No context found.
M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201--215, 1960.
Solving Hard Disjunctive Logic Programs Faster - Sometimes Gerald Pfeifer (2003) (Correct)
No context found.
M. Davis and H. Putnam. A Computing Procedure for Quantification Theory. JACM, 7:201--215, 1960.
A New Algorithm for Exact Reduction of Incompletely Specified .. - Pena, Oliveira (1999) (Correct)
No context found.
M. Davis and H. Putnam, "A computing procedure for quantification theory," J. ACM, vol. 7, no. 3, pp. 201--215, 1960.
Efficient Search Techniques for the Inference of Minimum.. - Oliveira, Marques-Silva (1998) (1 citation) (Correct)
No context found.
M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the Association for Computing Machinery, 7(3):201--215, 1960.
On Computing Minimum Unsatisfiable Cores - Lynce, Marques-Silva (2003) (1 citation) (Correct)
No context found.
M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the Association for Computing Machinery, 7:201--215, July 1960.
On Resolution Complexity of Matching Principles - Dantchev (2002) (Correct)
No context found.
M. Davis and H. Putnam. A computing procedure for quantification theory. Communications of the ACM, (7):201--215, 1960.
Heuristic-Based Backtracking for Propositional.. - Bhalla, Lynce, de.. (Correct)
No context found.
M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the Association for Computing Machinery, 7:201--215, July 1960.
Computing Preferred Safe Beliefs - Luis Angel Montiel (Correct)
No context found.
M. Davis and H. Putnam. A computing procedure for quantification theory. ACM, 7:201--215, 1960.
Towards Explaining Semantic Matching - McGuinness, Shvaiko, Giunchiglia.. (2004) (Correct)
No context found.
M. Davis and H. Putnam. A computing procedure for quantification theory. In Journal of the ACM, number 7, pages 201--215, 1960.
Combining SAT Methods with Non-Clausal Decision Heuristics - Barrett, Donham (2004) (2 citations) (Correct)
No context found.
Martin Davis and Hilary Putnam. A computing procedure for quantification theory. Journal of the ACM, 7(3):201--215, July 1960.
An Efficient Projected Minimal Conflict Generator for Projected.. - Elliott (2004) (Correct)
No context found.
Martin Davis and Hilary Putnam. A computing procedure for quantification theory. J. ACM, 7(3):201--215, 1960.
Models and Algorithms for Optimization Problems in Digital.. - Flores (2001) (Correct)
No context found.
M. Davis and H. Putnam. A Computing Procedure for Quantification Theory. Journal of the Association for Computing Machinery, 7:201-- 215, 1960.
Efficient Simplification of SAT Instances from Formal.. - Subbarayan (2004) (Correct)
No context found.
M. Davis and H. Putnam, "A Computing procedure for quantification theory". J. of the ACM,7 1960
On Efficiently Integrating Boolean and Theory-Specific Solving.. - Sebastiani (2004) (Correct)
No context found.
M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201--215, 1960.
Heuristic Backtracking Algorithms for SAT - Bhalla, Lynce, de Sousa.. (Correct)
No context found.
M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the Association for Computing Machinery, 7:201--215, July 1960.
Exact Algorithms for MAX-SAT - Zhang, Shen, al. (2003) (Correct)
No context found.
M. Davis, H. Putnam. A computing procedure for quantification theory. Journal of the Association for Computing Machinery 7, 3 (July 1960), 201--215.
Web Explanations For Semantic Heterogeneity Discovery - Shvaiko, al. (2004) (Correct)
No context found.
M. Davis and H. Putnam. A computing procedure for quantification theory. In Journal of the ACM, number 7, pages 201--215, 1960.
Darwin: A Theorem Prover for the Model Evolution Calculus - Baumgartner, Fuchs, Tinelli (2004) (Correct)
No context found.
Martin Davis and Hilary Putnam. A computing procedure for quantification theory. Journal of the ACM, 7(3):201--215, July 1960.
Improved Resolution Lower Bounds for the Weak Pigeonhole Principle - Razborov (2001) (6 citations) (Correct)
No context found.
M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7(3):210--215, 1960.
Postman Problems on Mixed Graphs - Mart (2003) (Correct)
No context found.
M. Davis and H. Putnam. A computing procedure for quantification theory. J. ACM, 7:201--215, 1960.
A Comparative Study of - Two Boolean Formulations (Correct)
No context found.
M. Davis and H. Putnam, "A Computing Procedure for Quantification Theory," J. ACM, vol. 7, pp. 201-215, 1960.
A Complete Adaptive Algorithm for Propositional Satisfiability - Bruni, Sassano (2002) (Correct)
No context found.
M. Davis and H. Putnam. A computing procedure for quantification theory. Jour. Assoc. for Comput. Mach. 7 (1960) 201--215.
Read-Once Branching Programs, Rectangular Proofs of the.. - Razborov, Wigderson, Yeo (1997) (3 citations) (Correct)
No context found.
M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7(3):210--215, 1960.
Acceleration of Satisfiability Algorithms by Reconfigurable .. - Platzner, De Micheli (1998) (4 citations) (Correct)
No context found.
M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, (7):201--215, 1960.
Memoization and DPLL: Formula Caching Proof Systems - Paul Beame Computer (2003) (Correct)
No context found.
M. Davis and H. Putnam. A computing procedure for quantification theory. Communications of the ACM, 7:201--215, 1960.
Persistent and Quasi-Persistent Lemmas - In Propositional Model (Correct)
No context found.
M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the Association for Computing Machinery, 7:201--215, 1960.
Building Logic Toolboxes - Heguiabehere (2003) (Correct)
No context found.
S. Davis and M. Putnam. A computing procedure for quantification theory. Journal of the Association for Computing Machinery, 7(3):201--215, 1960.
Solving Difficult Instances of Boolean Satisfiability .. - Aloul, Ramani.. (2003) (Correct)
No context found.
M. Davis and H. Putnam, "A computing procedure for quantification theory," J. ACM, vol. 7, no. 3, pp. 201--215, 1960.
DPLL(T): Fast Decision Procedures - Ganzinger, Hagen, Nieuwenhuis.. (2004) (1 citation) (Correct)
No context found.
M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201--215, 1960.
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