Sorting, Linear Time and the Satisfiability Problem.
Etienne GrandjeanPublished in: Ann. Math. Artif. Intell. (1996)
Keyphrases
- satisfiability problem
- np complete
- temporal logic
- search algorithm
- solving hard
- phase transition
- stochastic local search algorithms
- sat problem
- stochastic local search
- constraint satisfaction problems
- max sat
- sat instances
- decision procedures
- directed acyclic graph
- mazurkiewicz traces
- conjunctive normal form
- pspace complete
- model checking
- linear programming
- np hard
- computational complexity