Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT.
Clark W. BarrettDavid L. DillAaron StumpPublished in: CAV (2002)
Keyphrases
- quantifier free
- satisfiability problem
- cnf formula
- boolean formula
- propositional formulas
- sat problem
- first order logic
- conjunctive normal form
- propositional logic
- quantifier elimination
- random sat
- sat solvers
- np complete
- phase transition
- max sat
- propositional satisfiability
- boolean satisfiability
- horn clauses
- sat instances
- polynomial size
- rewrite systems
- davis putnam logemann loveland
- sat solving
- satisfiability testing
- davis putnam
- stochastic local search
- sat encodings
- real numbers
- truth assignment
- machine translation
- automata theoretic
- binary decision diagrams
- predicate calculus
- constraint satisfaction problems
- expressive power
- cross language information retrieval
- constraint satisfaction
- linear temporal logic
- unit propagation
- temporal logic
- normal form
- search algorithm
- randomly generated
- practical problems
- linear constraints
- knowledge compilation
- term rewriting
- logical formulas
- propositional theories
- membership queries
- search space