Applying the Davis-Putnam Procedure to Non-clausal Formulas.
Enrico GiunchigliaRoberto SebastianiPublished in: AI*IA (1999)
Keyphrases
- davis putnam
- propositional logic
- cnf formula
- satisfiability problem
- propositional satisfiability
- knowledge compilation
- boolean formula
- sat problem
- propositional formulas
- tree search
- phase transition
- first order logic
- np complete
- horn clauses
- quantified boolean formulae
- sat solvers
- constraint propagation
- constraint satisfaction
- conjunctive normal form
- stochastic local search
- constraint programming
- max sat
- belief revision
- automated reasoning
- clause learning
- temporal logic
- search algorithm
- normal form
- inductive logic programming
- heuristic search
- constraint satisfaction problems
- boolean satisfiability
- state space
- special case