Implementing the Davis-Putnam method

DOI10.1023/A:1006351428454zbMath0967.68148MaRDI QIDQ1977761

Mark E. Stickel, Han-Tao Zhang

Publication date: 18 May 2000

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

zbMATH Keywords

satisfiabilityDavis-Putnam method

Mathematics Subject Classification ID

Related Items (15)

Semantically-guided goal-sensitive reasoning: model representation ⋮ A comparative runtime analysis of heuristic algorithms for satisfiability problems ⋮ Propositional SAT Solving ⋮ Unnamed Item ⋮ A Computing Procedure for Quantification Theory ⋮ The Relation Between Complete and Incomplete Search ⋮ Approximating minimal unsatisfiable subformulae by means of adaptive core search ⋮ MACE4 and SEM: A Comparison of Finite Model Generators ⋮ UnitWalk: A new SAT solver that uses local search guided by unit clause elimination ⋮ Problems on the generation of finite models ⋮ A complete adaptive algorithm for propositional satisfiability ⋮ Approximate coherence-based reasoning ⋮ Formal verification of a generic framework to synthesize SAT-provers ⋮ Contingent planning under uncertainty via stochastic satisfiability ⋮ ASSAT: computing answer sets of a logic program by SAT solvers

This page was built for publication: Implementing the Davis-Putnam method