Resolution and Clause-Learning with Restarts for Signed CNF Formulas.
David MitchellPublished in: FLAP (2017)
Keyphrases
- clause learning
- davis putnam
- cnf formula
- sat problem
- sat solvers
- max sat
- satisfiability problem
- np complete
- propositional satisfiability
- phase transition
- constraint satisfaction problems
- orders of magnitude
- propositional formulas
- constraint satisfaction
- sat instances
- decision problems
- randomly generated
- stochastic local search
- conjunctive normal form
- genetic algorithm
- boolean formula
- answer sets
- branch and bound
- np hard
- search space
- relational databases