Computational space efficiency and minimal model generation for guarded formulae

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2250, Issue , 2001, Pages 85-99

  Georgieva, Lilia ^a   Hustadt, Ullrich ^b   Schmidt, Renate A ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; DATA DESCRIPTION;

CONCRETE APPLICATIONS; DECISION PROCEDURE; DESCRIPTION LOGIC; GUARDED FRAGMENT; MINIMAL MODEL GENERATIONS; MODEL CONSTRAINTS; SPACE AND TIME COMPLEXITY; SPACE EFFICIENCIES;

COMPUTATIONAL EFFICIENCY;

EID: 84937400647     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45653-8_6     Document Type: Conference Paper

References (22)

1. H. Andréka, I. Németi, and J. Van Benthem. Modal languages and bounded fragments of predicate logic. J. Philos. Logic, 27(3):217-274, 1998.
2. C. Aravindan and P. Baumgartner. Theorem proving techniques for view deletion in databases. Journal of Symbolic Computation, 29(2):119-147, 2000.
3. L. Bachmair, H. Ganzinger, and U. Waldmann. Superposition with simplification as a decision procedure for the monadic class with equality. In Proc. KGC'93, vol. 713 of LNCS, pp. 83-96. Springer, 1993.
4. P. Baumgartner, P. Fröhlich, U. Furbach, and W. Nejdl. Semantically guided theorem proving for diagnosis applications. In Proc. IJCAI'97, pp. 460-465. Morgan Kaufmann, 1997.
5. P. Baumgartner, J. Horton, and B. Spencer. Merge path improvements for minimal model hyper tableaux. In Proc. TABLEAUX'99, vol. 1617 of LNAI. Springer, 1999.
6. F. Bry and A. Yahya. Positive unit hyperresolution tableaux for minimal model generation. J. Automated Reasoning, 25(1):35-82, 2000.
7. H. De Nivelle and M. De Rijke. Deciding the guarded fragments by resolution. To appear in J. Symbolic Computat., 2001.
8. H. De Nivelle, R. A. Schmidt, and U. Hustadt. Resolution-based methods for modal logics. Logic J. IGPL, 8(3):265-292, 2000.
9. H. Ganzinger and H. De Nivelle. A superposition decision procedure for the guarded fragment with equality. In Proc. LICS'99, pp. 295-303. IEEE Computer Society Press, 1999.
10. H. Ganzinger, C. Meyer, and M. Veanes. The two-variable guarded fragment with transitive relations. In Proc. LICS'99, pp. 24-34. IEEE Computer Society, 1999.
11. L. Georgieva, U. Hustadt, and R. A. Schmidt. Hyperresolution for guarded formulae. In Proc. of FTP'2000, pp. 101-112. Univ. Koblenz-Landau, 2000.
12. E. Grädel. On the restraining power of guards. J. Symbolic Logic, 64:1719-1742, 1999.
13. E. Grädel and I. Walukiewicz. Guarded fixed point logic. In Proc. LICS'99, pp. 45-54. IEEE Computer Society Press, 1999.
14. R. Hasegawa, H. Fujita, and M. Koshimura. Efficient minimal model generation using branching lemmas. In Proc. CADE-17, LNAI, pp. 184-199. Springer, 2000.
15. U. Hustadt and R. A. Schmidt. Using resolution for testing modal satisfiability and building models. To appear in J. Automated Reasoning, 2001.
16. A. Leitsch. Deciding clause classes by semantic clash resolution. Fundamenta Informatica, 18:163-182, 1993.
17. R. Letz and G. Stenz. Model elimination and connection tableau procedures. In A. Robinson and A. Voronkov, eds., Handbook of Automated Reasoning, pp. 2017-2116. Elsevier, 2001.
18. C. Lutz, U. Sattler, and S. Tobies. A suggestion of an n-ary description logic. In Proc. DL'99, pp. 81-85. Linköping University, 1999.
19. J.-J. Ch. Meyer, W. Van Der Hoek, and B. Van Linder. A logical approach to the dynamics of commitments. Artificial Intelligence, 113(1-2):1-40, 1999.
20. I. Niemelä. A tableau calculus for minimal model reasoning. In Proc. TABLEAUX'96, vol. 1071 of LNAI, pp. 278-294. Springer, 1996.
21. M. Schmidt-Schauß and G. Smolka. Attributive concept descriptions with complements. J. Artificial Intelligence, 48:1-26, 1991.
22. C. Weidenbach. Spass: Combining superposition, sorts and splitting. In A. Robinson and A. Voronkov, eds., Handbook of Automated Reasoning, pp. 1967-2015. Elsevier, 2001.