Solving the Satisfiability Problem of Modal Logic S5 Guided by Graph Coloring.
Pei HuangMinghao LiuPing WangWenhui ZhangFeifei MaJian ZhangPublished in: IJCAI (2019)
Keyphrases
- graph coloring
- satisfiability problem
- modal logic
- temporal logic
- max sat
- phase transition
- np complete problems
- decision procedures
- weighted max sat
- combinatorial problems
- sat problem
- model checking
- stochastic local search
- np complete
- inference rules
- sat instances
- constraint satisfaction
- job shop scheduling
- pspace complete
- search algorithm
- constraint satisfaction problems
- situation calculus
- symmetry breaking
- belief revision
- sat encodings
- branch and bound
- upper bound
- tabu search
- np hard
- lower bound
- combinatorial optimization