The Unique Horn-Satisfiability Problem and Quadratic Boolean Equations.
Michel MinouxPublished in: Ann. Math. Artif. Intell. (1992)
Keyphrases
- satisfiability problem
- conjunctive normal form
- np complete
- temporal logic
- phase transition
- np hard
- search algorithm
- stochastic local search algorithms
- davis putnam logemann loveland
- sat problem
- stochastic local search
- boolean functions
- sat instances
- pspace complete
- propositional logic
- max sat
- computational complexity
- expressive power
- decision procedures
- special case
- objective function