On the satisfiability threshold of formulas with three literals per clause.
Josep DíazLefteris M. KirousisDieter MitscheXavier Pérez-GiménezPublished in: Theor. Comput. Sci. (2009)
Keyphrases
- boolean formula
- cnf formula
- propositional formulas
- conjunctive normal form
- unit propagation
- truth assignment
- horn clauses
- np complete
- sat problem
- sat solvers
- practical problems
- max sat
- satisfiability problem
- satisfiability testing
- linear constraints
- quantified boolean formulas
- membership queries
- propositional logic
- threshold selection
- binary decision diagrams
- knowledge compilation
- propositional variables
- constraint satisfaction problems
- normal form
- logic programs
- davis putnam
- inference rules
- orders of magnitude
- phase transition
- equivalence queries
- propositional satisfiability
- np hard