The Minimum Satisfiability Problem.
Rajeev KohliRamesh KrishnamurtiPrakash MirchandaniPublished in: SIAM J. Discret. Math. (1994)
Keyphrases
- satisfiability problem
- np complete
- search algorithm
- temporal logic
- phase transition
- solving hard
- sat problem
- stochastic local search
- stochastic local search algorithms
- decision procedures
- finite domain
- search space
- constraint satisfaction problems
- max sat
- mazurkiewicz traces
- conjunctive normal form
- pspace complete
- sat instances