A Subset-Matching Size-Bounded Cache for Testing Satisfiability in Modal Logics.
Enrico GiunchigliaArmando TacchellaPublished in: Ann. Math. Artif. Intell. (2001)
Keyphrases
- modal logic
- decision procedures
- temporal logic
- inference rules
- nonmonotonic logics
- satisfiability problem
- computational complexity
- hit rate
- situation calculus
- theorem proving
- default logic
- matching algorithm
- epistemic logic
- automated reasoning
- conjunctive queries
- propositional logic
- main memory
- classical logic
- model checking
- bounded treewidth
- block size
- search algorithm