Issues of decidability for description logics in the framework of resolution

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

Volumn 1761 LNAI, Issue , 2000, Pages 191-205

  Hustadt, Ullrich ^a   Schmidt, Renate A ^a  

^a MANCHESTER METROPOLITAN UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; THEOREM PROVING;

AUTOMATED MODEL GENERATIONS; DECISION PROCEDURE; DESCRIPTION LOGIC; ORDER RESTRICTION; ROLE HIERARCHY; SELECTION RESTRICTIONS;

DATA DESCRIPTION;

EID: 84867816746     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46508-1_13     Document Type: Conference Paper

References (21)

1. F. Baader, B. Hollunder, B. Nebel, H.-J. Profitlich, and E. Franconi. An empirical analysis of optimization techniques for terminological representation systems or "making KRIS get a move on". Applied Intelligence, 4(2):109-132, 1994.
2. M. Baaz, C. Fermüller, and A. Leitsch. A non-elementary speed-up in proof length by structural clause form transformation. In Proc. LICS'94, pages 213-219. IEEE Computer Society Press, 1994.
3. L. Bachmair and H. Ganzinger. Ordered chaining calculi for first-order theories of binary relations. Research report MPI-I-95-2-009, Max-Planck-Institut für Informatik, Saarbrücken, Germany, 1995. To appear in J. ACM.
4. L. Bachmair and H. Ganzinger. A theory of resolution. Research report MPI-I-97-2-005, Max-Planck-Institut für Informatik, Saarbrücken, Germany, 1997.
5. To appear in J. A. Robinson and A. Voronkov (eds.), Handbook of Automated Reasoning.
6. H. de Nivelle. A resolution decision procedure for the guarded fragment. In Proc. CADE-15, LNAI 1421, pages 191-204. Springer, 1998.
7. F. M. Donini, M. Lenzerini, D. Nardi, and A. Schaerf. Deduction in concept languages: From subsumption to instance checking. J. Logic and Computation, 4:423-452, 1994.
8. C. Fermüller, A. Leitsch, T. Tammet, and N. Zamov. Resolution Method for the Decicion Problem. LNCS 679. Springer, 1993.
9. H. Ganzinger, U. Hustadt, C. Meyer, and R. A. Schmidt. A resolution-based decision procedure for extensions of K4. To appear in Advances in Modal Logic, Volume 2. CSLI Publications, 1999.
10. E. Hemaspaandra. The price of universality. Notre Dame J. Formal Logic, 37(2):174-203, 1996.
11. I. Horrocks. Optimising Tableaux Decision Procedures for Description Logics. PhD thesis, University of Manchester, Manchester, UK, 1997.
12. U. Hustadt and R. A. Schmidt. On evaluating decision procedures for modal logic. In Proc. IJCAI'97, pages 202-207. Morgan Kaufmann, 1997.
13. W. H. Joyner Jr. Resolution strategies as decision procedures. J. ACM, 23(3):398-417, 1976.
14. B. Kallick. A decision procedure based on the resolution method. In Information Processing 68, Volume 1, pages 269-275. North-Holland, 1968.
15. M. Marx. Mosaics and cylindric modal logic of dimension 2. In Advances in Modal Logic, Volume 1, Lecture Notes 87, pages 141-156. CSLI Publications, 1996.
16. M. Paramasivam and D. A. Plaisted. Automated deduction techniques for classification in description logic systems. J. Automated Reasoning, 20:337-364, 1998.
17. D. A. Plaisted and S. Greenbaum. A structure-preserving clause form translation. J. Symbolic Computation, 2:293-304, 1986.
18. R. A. Schmidt. Decidability by resolution for propositional modal logics. To appear in J. Automated Reasoning.
19. M. Schmidt-Schauß and G. Smolka. Attributive concept description with complements. Artifical Intelligence, 48:1-26, 1991.
20. T. Tammet. Using resolution for extending KL-ONE-type languages. In Proc. CIKM'95, 1995.
21. A. Urquhart. The complexity of propositional proofs. Bull. Symbolic Logic, 1(4):425-467, 1995.