Implementing the Davis-Putnam method
From MaRDI portal
Recommendations
Cited in
(23)- Approximate coherence-based reasoning
- ADDING A UNITON VIA THE DPW METHOD
- Implementing the Davis-Putnam method
- A comparative runtime analysis of heuristic algorithms for satisfiability problems
- Towards an efficient library for SAT: A manifesto
- A Computational Study of Satisfiability Algorithms for Propositional Logic
- Semantically-guided goal-sensitive reasoning: model representation
- A Computing Procedure for Quantification Theory
- Propositional SAT solving
- Multi-valued extension of Putnam-Davis procedure
- Davis-Putnam style rules for deciding property S.
- A complete adaptive algorithm for propositional satisfiability
- ASSAT: computing answer sets of a logic program by SAT solvers
- Approximating minimal unsatisfiable subformulae by means of adaptive core search
- Problems on the generation of finite models
- MACE4 and SEM: a comparison of finite model generators
- The Relation Between Complete and Incomplete Search
- scientific article; zbMATH DE number 1538056 (Why is no real title available?)
- The Davidson Method
- Contingent planning under uncertainty via stochastic satisfiability
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
- scientific article; zbMATH DE number 1670593 (Why is no real title available?)
- Formal verification of a generic framework to synthesize SAT-provers
This page was built for publication: Implementing the Davis-Putnam method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1977761)
