Resolution and Clause Learning for Multi-Valued CNF Formulas.
David MitchellPublished in: PRUV (2014)
Keyphrases
- clause learning
- multi valued
- davis putnam
- sat problem
- cnf formula
- sat solvers
- max sat
- satisfiability problem
- np complete
- propositional satisfiability
- constraint satisfaction problems
- phase transition
- conjunctive normal form
- boolean functions
- normal form
- sat instances
- randomly generated
- search strategies
- temporal logic
- decision problems
- boolean formula
- propositional formulas
- truth values
- propositional logic
- stochastic local search
- database
- branch and bound
- orders of magnitude
- evolutionary algorithm
- knowledge base