A Subset-Matching Size-Bounded Cache for Satisfiability in Modal Logics.
Enrico GiunchigliaArmando TacchellaPublished in: TABLEAUX (2000)
Keyphrases
- modal logic
- decision procedures
- temporal logic
- nonmonotonic logics
- inference rules
- satisfiability problem
- hit rate
- theorem proving
- computational complexity
- prefetching
- propositional logic
- hit ratio
- automated reasoning
- matching algorithm
- default logic
- main memory
- epistemic logic
- modal operators
- nonmonotonic reasoning
- classical logic
- query processing
- model theoretic
- reinforcement learning
- bayesian networks