On Solving Stack-Based Incremental Satisfiability Problems.
Joonyoung KimJesse WhittemoreKarem A. SakallahPublished in: ICCD (2000)
Keyphrases
- satisfiability problem
- solving hard
- stochastic local search
- sat instances
- finite domain
- np complete
- phase transition
- temporal logic
- graph coloring problems
- search algorithm
- sat problem
- weighted max sat
- stochastic local search algorithms
- combinatorial problems
- random sat
- search problems
- constraint propagation
- pspace complete
- davis putnam
- davis putnam logemann loveland
- max sat
- lower bound
- randomly generated
- propositional logic
- constraint programming
- belief revision
- combinatorial optimization
- model checking
- constraint satisfaction problems