Satisfiability Problems for Propositional Calculi.
Harry R. LewisPublished in: Math. Syst. Theory (1979)
Keyphrases
- satisfiability problem
- conjunctive normal form
- cl pc
- np complete
- temporal logic
- search algorithm
- propositional logic
- coalition logic
- phase transition
- sat problem
- first order logic
- model checking
- clause learning
- solving hard
- davis putnam logemann loveland
- sat instances
- pspace complete
- stochastic local search algorithms
- default logic
- dynamic logic
- stochastic local search
- cnf formula
- propositional variables
- constraint satisfaction problems
- belief revision
- davis putnam
- modal logic
- propositional formulas
- horn clauses
- finite domain
- mazurkiewicz traces
- max sat