Computational Space Efficiency and Minimal Model Generation for Guarded Formulae
- 20 November 2001
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Superposition with simplification as a decision procedure for the monadic class with equalityPublished by Springer Nature ,2005
- A superposition decision procedure for the guarded fragment with equalityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The two-variable guarded fragment with transitive relationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Resolution-based methods for modal logicsLogic Journal of the IGPL, 2000
- Theorem Proving Techniques for View Deletion in DatabasesJournal of Symbolic Computation, 2000
- Efficient Minimal Model Generation Using Branching LemmasPublished by Springer Nature ,2000
- Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model GenerationJournal of Automated Reasoning, 2000
- On the Restraining Power of GuardsThe Journal of Symbolic Logic, 1999
- Merge Path Improvements for Minimal Model Hyper TableauxPublished by Springer Nature ,1999
- Modal Languages and Bounded Fragments of Predicate LogicJournal of Philosophical Logic, 1998