A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas.
Cristopher MooreGabriel IstrateDemetrios D. DemopoulosMoshe Y. VardiPublished in: APPROX-RANDOM (2005)
Keyphrases
- random sat
- random sat instances
- sat problem
- satisfiability problem
- phase transition
- cnf formula
- truth assignment
- propositional formulas
- propositional logic
- boolean formula
- np complete
- sat instances
- conjunctive normal form
- sat solvers
- boolean satisfiability
- knowledge compilation
- max sat
- randomly generated
- stochastic local search
- propositional satisfiability
- np hard
- davis putnam
- higher order
- continuous functions
- constraint satisfaction problems
- search algorithm
- sat solving
- horn clauses
- satisfiability testing
- sat encodings
- constraint satisfaction
- random instances
- graph coloring
- branch and bound algorithm
- owl dl ontology
- search space
- randomly chosen
- lower bound
- unit propagation
- first order logic
- combinatorial problems
- temporal logic