Propositional Temporal Proving with Reductions to a SAT Problem.
Richard WilliamsBoris KonevPublished in: CADE (2013)
Keyphrases
- sat problem
- satisfiability problem
- propositional logic
- propositional formulas
- davis putnam
- cnf formula
- sat solvers
- max sat
- constraint satisfaction problems
- np complete
- phase transition
- randomly generated
- sat instances
- boolean satisfiability
- clause learning
- random sat instances
- propositional satisfiability
- stochastic local search
- sat solving
- boolean formula
- conjunctive normal form
- weighted max sat
- first order logic
- decision problems
- maximum satisfiability