Abstract
We consider the problem of integrating Reiter's default logic into terminological representation systems. It turns out that such an integration is less straightforward than we expected, considering the fact that the terminological language is a decidable sublanguage of first-order logic. Semantically, one has the unpleasant effect that the consequences of a terminological default theory may be rather unintuitive, and may even vary with the syntactic structure of equivalent concept expressions. This is due to the unsatisfactory treatment of open defaults via Skolemization in Reiter's semantics. On the algorithmic side, this treatment may lead to an undecidable default consequence relation, even though our base language is decidable, and we have only finitely many (open) defaults. Because of these problems, we then consider a restricted semantics for open defaults in our terminological default theories: default rules are only applied to individuals that are explicitly present in the knowledge base. In this semantics it is possible to compute all extensions of a finite terminological default theory, which means that this type of default reasoning is decidable.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
F. Baader and P. Hanschke. A Scheme for Integrating Concrete Domains into Concept Languages. Research Report RR-91-10, DFKI Kaiserslautern, 1991.
F. Baader and P. Hanschke. A scheme for integrating concrete domains into concept languages. In Proceedings of the 12th International Joint Conference on Artificial Intelligence, Sydney, Australia, 1991.
F. Baader and B. Hollunder. Embedding defaults into terminological knowledge representation formalisms. In Proceedings of the 3rd International Conference on Knowledge Representation and Reasoning, Cambridge, Mass., 1992.
F. Baader and B. Hollunder. How to prefer more specific defaults in terminological default logic. Research Report RR-92-58, DFKI Saarbrücken, 1992. Also to appear in Proceedings of the 13th International Joint Conference on Artificial Intelligence, Chambery, France, 1993.
F. Baader and K. Schlechta. A semantics for open normal defaults via a modified preferential approach. Research Report RR-93-13, DFKI Saarbrücken, 1993.
R. J. Brachman. 'I lied about the trees’ or, defaults and definitions in knowledge representation. The AI Magazine, 6(3):80–93, 1985.
R. J. Brachman, D. L. McGuinness, P. F. Patel-Schneider, L. A. Resnick, and A. Borgida. Living with CLASSIC: When and how to use a KL-ONE-like language. In J. Sowa, editor, Principles of Semantic Networks, pages 401–456. Morgan Kaufmann, San Mateo, Calif., 1991.
R. J. Brachman and J. G. Schmolze. An overview of the KL-ONE knowledge representation system. Cognitive Science, 9(2):171–216, 1985.
J. Doyle. A truth maintenance system. Artificial Intelligence, 12:231–272, 1979.
M. Garey and D. Johnson. Computers and Intractability — A Guide to the Theory of NP-Completeness. Freeman, San Francisco, Cal., 1979.
B. Hollunder. Hybrid inferences in KL-ONE-based knowledge representation systems. In 14th German Workshop on Artificial Intelligence, volume 251 of Informatik-Fachberichte, pages 38–47, Ebingerfeld, Germany, 1990. Springer.
U. Junker and K. Konolige. Computing extensions of autoepistemic and default logics with a truth maintenance system. In Proceedings of the 8th National Conference on Artificial Intelligence, pages 278–283, Boston, Mass., 1990.
H. A. Kautz and B. Selman. Hard problems for simple defaults. In Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning, pages 189–197, Toronto, Ont., 1989.
A. Kobsa. The SB-ONE knowledge representation workbench. In Preprints of the Workshop on Formal Aspects of Semantic Networks, Two Habours, Calif., 1989.
E. Mays and B. Dionne. Making KR systems useful. In Terminological Logic Users Workshop — Proceedings, pages 11–12, KIT-Report 95, TU Berlin, 1991.
J. McCarthy. Circumscription — a form of non-monotonic reasoning. Artificial Intelligence, 13:27–39, 1980.
D. McDermott and J. Doyle. Non-monotonic logic I. Artificial Intelligence, 13:41–72, 1980.
R. McGregor. Statement of interest. In K. von Luck, B. Nebel, and C. Peltason, editors, Statement of Interest for the 2nd International Workshop on Terminological Logics. Document D-91-13, DFKI Kaiserslautern, 1991.
μBACK. System presentation. In Terminological Logic Users Workshop — Proceedings, page 186, KIT-Report 95, TU Berlin, 1991.
C. Peltason, K. v. Luck, and C. Kindermann (Org.). Terminological logic users workshop — Proceedings. KIT Report 95, TU Berlin, 1991.
R. Reiter. A logic for default reasoning. Artificial Intelligence, 13(1–2):81–132, 1980.
R. Reiter. A theory of diagnosis from first principles. Artificial Intelligence, 32:57–95, 1987.
R. Rymon. Search through systematic set enumeration. In Proceedings of the 3rd International Conference on Knowledge Representation and Reasoning, Cambridge, Mass., 1992.
M. Schmidt-Schauß and G. Smolka. Attributive concept descriptions with complements. Artificial Intelligence, 47, 1991.
C. Schwind and V. Risch. A tableau-based characterisation for default logic. In Proceedings of the 1st European Conference on Symbolic and Quantitative Approaches for Uncertainty, pages 310–317, Marseille, France, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Baader, F., Hollunder, B. (1994). Computing extensions of terminological default theories. In: Lakemeyer, G., Nebel, B. (eds) Foundations of Knowledge Representation and Reasoning. Lecture Notes in Computer Science, vol 810. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58107-3_3
Download citation
DOI: https://doi.org/10.1007/3-540-58107-3_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58107-9
Online ISBN: 978-3-540-48453-0
eBook Packages: Springer Book Archive