Generation of Hard Non-Clausal Random Satisfiability Problems.
Juan Antonio Navarro PérezAndrei VoronkovPublished in: AAAI (2005)
Keyphrases
- satisfiability problem
- random sat
- phase transition
- random instances
- stochastic local search
- np complete
- sat problem
- sat instances
- search algorithm
- temporal logic
- graph coloring problems
- randomly generated
- stochastic local search algorithms
- max sat
- solving hard
- davis putnam
- theorem proving
- constraint satisfaction
- boolean satisfiability
- combinatorial problems
- defeasible logic
- pspace complete
- mazurkiewicz traces
- davis putnam logemann loveland
- constraint propagation
- cellular automata
- scheduling problem