Computational Space Efficiency and Minimal Model Generation for Guarded Formulae

Authors:
Lilia Georgieva;Ullrich Hustadt;Renate A. Schmidt
Affiliations:
-;-;-
Venue:
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Year:
2001

Citing 14
Cited 2

Attributive concept descriptions with complements

Artificial Intelligence
A logical approach to the dynamics of commitments

Artificial Intelligence
Theorem proving techniques for view deletion in databases

Journal of Symbolic Computation - Special issue on advances in first-order theorem proving
Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation

Journal of Automated Reasoning
Using Resolution for Testing Modal Satisfiability and Building Models

Journal of Automated Reasoning
A Tableau Calculus for Minimal Model Reasoning

TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Superposition with Simplification as a Desision Procedure for the Monadic Class with Equality

KGC '93 Proceedings of the Third Kurt Gödel Colloquium on Computational Logic and Proof Theory
Efficient Minimal Model Generation Using Branching Lemmas

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Deciding the guarded fragments by resolution

Journal of Symbolic Computation
Combining superposition, sorts and splitting

Handbook of automated reasoning
Model elimination and connection tableau procedures

Handbook of automated reasoning
Guarded Fixed Point Logic

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
The Two-Variable Guarded Fragment with Transitive Relations

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
A Superposition Decision Procedure for the Guarded Fragment with Equality

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science

A Tableau Calculus for Minimal Modal Model Generation

Electronic Notes in Theoretical Computer Science (ENTCS)
Blocking and other enhancements for bottom-up model generation methods

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a number of hyperresolution-based decision procedures for a subfragment of the guarded fragment. We first present a polynomial space decision procedure of optimal worst-case space and time complexity for the fragment under consideration. We then consider minimal model generation procedures which construct all and only minimal Herbrand models for guarded formulae. These procedures are based on hyperresolution, (complement) splitting and either model constraint propagation or local minimality tests. All the procedures have concrete application domains and are relevant for multi-modal and description logics that can be embedded into the considered fragment.