Prefixed resolution: A resolution method for modal and description logics

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

Volumn 1632, Issue , 1999, Pages 187-201

  Areces, Carlos ^a   de Nivelle, Hans ^a   de Rijke, Maarten ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; COMPUTER CIRCUITS; FORMAL LANGUAGES; HEURISTIC METHODS; RECONFIGURABLE HARDWARE; THEOREM PROVING;

DESCRIPTION LOGIC; MODAL LOGIC; PROOF PROCEDURES; PROPOSITIONAL RESOLUTION; RESOLUTION METHODS;

DATA DESCRIPTION;

EID: 84957691224     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48660-7_13     Document Type: Conference Paper

References (20)

1. Y. Auffray, P. Enjalbert, and J. Hebrard. Strategies for modal resolution: results and problems. Journal of Automated Reasoning, 6(1):1-38, 1990.
2. F. Baader, B. Hollunder, B. Nebel, H. Profitlich, and E. Franconi. An empirical analysis of optimization techniques for terminological representation systems or: Making KRIS get a move on. Journal of Applied Intelligence, 4:109-132, 1994.
3. P. Blackburn. Internalizing labeled deduction. Technical Report CLAUS-Report 102, Computerlinguistik, Universitat des Saarlandes, 1998.
4. P. Blackburn and M. Tzakova. Hybridizing concept languages. Annals of Mathematics and Artificial Intelligence, 24:23-49, 1998.
5. R. Brachman and H. Levesque. The tractability of subsumption in frame-based description languages. In AAAI-84, pages 34-37, 1984.
6. R. Brachman and J. Schmolze. An overview of the KL-ONE knowledge representation system. Cognitive Science, 9(2):171-216, 1985.
7. D. Calvanese, G. De Giacomo, and M. Lenzerini. Conjunctive query containment in description logics with nary relations. In Proc. of DL-97, pages 5-9, June 1997.
8. H. de Nivelle. Ordering refinements of resolution. PhD thesis, Technische Universiteit Delft, Delft. The Netherlands, October 1994.
9. H. de Nivelle and M. de Rijke. Resolution decides the guarded fragment. Submitted for journal publication, 1998.
10. M. de Rijke. Restricted description languages. Unpublished, 1998.
11. F. Donini, M. Lenzerini, D. Nardi, and A. Schaerf. Deduction in concept languages: from subsumption to instance checking. Journal of Logic and Computation, 4(4):423-452, 1994.
12. P. Enjalbert and L. Farinas del Cerro. Modal resolution in clausal form. Theoretical Computer Science, 65(1):1-33, 1989.
13. L. Farinas del Cerro. A simple deduction method for modal logic. Information Processing Letters, 14:49-51, April 1982.
14. C. Fermiiller, A. Leitsch, T. Tammet, and N. Zamov. Resolution methods for the decision problem. Springer-Verlag, Berlin, 1993. LNAI.
15. I. Horrocks and P. Patel-Schneider. Optimising description logic subsumption. Submitted to the Journal of Logic and Computation, 1998.
16. U. Hustadt and R. Schmidt. Issues of decidability for description logics. Unpublished, 1998.
17. G. Mints. Resolution calculi for modal logics. American Mathematical Society Translations, 143:1-14, 1989.
18. K. Schild. A correspondence theory for terminological logics. In Proc. of the 12th IJCAI, pages 466-471, 1991.
19. M. Schmidt-Schauss and G. Smolka. Attributive concept descriptions with complements. Artificial Intelligence, 48:1-26, 1991.
20. T. Tammet. Using resolution for extending KL-ONE-type languages. In Proc. of the 4th CIKM. ACM Press, November 1995