The Complexity of Satisfiability Problems over Finite Lattices.
Bernhard SchwarzPublished in: STACS (2004)
Keyphrases
- satisfiability problem
- pspace complete
- np complete
- search algorithm
- phase transition
- temporal logic
- stochastic local search algorithms
- model checking
- sat problem
- mazurkiewicz traces
- random sat
- solving hard
- max sat
- computational complexity
- stochastic local search
- belief revision
- constraint satisfaction problems
- state space