LCF-Style Propositional Simplification with BDDs and SAT Solvers.
Hasan AmjadPublished in: TPHOLs (2008)
Keyphrases
- sat solvers
- clause learning
- knowledge compilation
- boolean formula
- propositional satisfiability
- propositional theories
- heuristic search
- orders of magnitude
- constraint satisfaction
- binary decision diagrams
- propositional logic
- sat solving
- boolean satisfiability
- max sat
- search space
- search strategies
- sat problem
- search tree
- propositional formulas
- sat instances
- conjunctive normal form
- weighted max sat
- first order logic
- sat encodings
- clause learning sat solvers
- constraint programming
- state space
- cnf formula
- multi valued
- planning problems
- normal form
- information retrieval systems
- information retrieval