CEGAR-Tableaux: Improved Modal Satisfiability via Modal Clause-Learning and SAT.
Rajeev GoréCormac KikkertPublished in: TABLEAUX (2021)
Keyphrases
- modal logic
- clause learning
- satisfiability problem
- sat problem
- sat solvers
- sat solving
- temporal logic
- decision procedures
- propositional satisfiability
- sat instances
- davis putnam
- np complete
- model checking
- proof procedure
- boolean satisfiability
- propositional logic
- sat encodings
- constraint satisfaction problems
- boolean formula
- unit propagation
- cnf formula
- computational complexity
- stochastic local search
- max sat
- randomly generated
- inference rules
- phase transition
- orders of magnitude
- search space
- constraint programming
- belief revision
- special case
- data structure
- satisfiability testing