On the satisfiability problem for a 4-level quantified syllogistic and some applications to modal logic (extended version)
Domenico CantoneMarianna Nicolosi AsmundoPublished in: CoRR (2012)
Keyphrases
- modal logic
- temporal logic
- satisfiability problem
- decision procedures
- model checking
- inference rules
- mazurkiewicz traces
- nonmonotonic logics
- situation calculus
- conditional logic
- np complete
- sat problem
- pspace complete
- search algorithm
- default logic
- belief revision
- classical logic
- sat instances
- stochastic local search
- epistemic logic
- dynamic logic
- prime implicates
- programming language
- np hard
- modal operators
- lower bound