Proceedings

How to Prefer More Specific Defaults in Terminological Default Logic

Download BibTeX Cite

Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence. Knowledge Representation. Pages 669-674.

© 1993 International Joint Conferences on Artificial Intelligence

Abstract

In a recent paper we have proposed terminological default logic as a formalism which combines both means for structured representation of classes and objects, and for default inheritance of properties. The major drawback which terminological default logic inherits from general default logic is that it does not take precedence of more specific defaults over more general ones into account. The pres e nt paper addresses the problem of modifying terminological default logic such that more specific defaults are preferred. It turns out that the existing approaches for expressing priorities between defaults do not seem to be appropriate for this purpose. Therefore we shall consider an alternative approach for dealing with prioritization in the framework of Reiter's default logic. The formalism is presented in the general setting of default logic where priorities are given by an arbitrary partial ordering on the defaults. We shall exhibit some interesting properties of the new formalism, compare it with existing approaches, and describe an algorithm for computing extensions.

  1. F . Baader and B. Hollunder . How to prefer more specific defaults in terminological default logic. Re- search Report RR-92-58, DFKI Saarbriicken, 1992.
  2. F. Baader and B. Hollunder. Embedding defaults into terminological knowledge representation for- malisms. In Proceedings of KR '92, Cambridge, Mass., 1992.
  3. P. Besnard. An Introduction to Default Logic. Sym- bolic Computation Series . Springer, 1989.
  4. R. J. Brachman, D. L. McGuinness, P . F. Patel- Schneider, L. A . Resnick, and A. Borgida. Liv- ing with CLASSIC: When and how to use a KL- ONE-like language . In J . Sowa, editor, Principles of Semantic Networks, pages 401-456.
  5. Morgan Kauf- mann, San Mateo, Calif., 1991.
  6. G. Brewka. Preferred subtheories: An extended log- ical framework for default reasoning. In Proceedings of IJCAI'89, Detroit, Mich., 1989. IJCAI
  7. G. Brewka. Nonmonotonic Reasoning: Logical Foundations of Commonsense. Cambridge Univer- sity Press, Cambridge, 1991.
  8. J . P. Delgrande and W . K. Jackson. Default logic revisited. In Proceedings of KR'91, Cambridge, Mass., 1991.
  9. M. L. Ginsberg, eJ. Readings in Nonmonotonic Rea- soning. Morgan Kaufmann, Los Altos, Cal., 1987.
  10. U. Junker and G. Brewka. Handling partially or- dered defaults in TMS. In Proceedings of the 1st European Conference on Symbolic and Quantita- tive Approaches for Uncertainty, Marseille, France, 1991.
  11. V. Lifschitz. Computing circumscription. In Pro- ceedings of IJCAI'85, Los Angeles, Calif., 1985 .
  12. E. Mays and B. Dionne. Making KRsystems useful. In [15], pages 11-12.
  13. R. McGregor. Statement of interest. In K. von Luck, B. Nebel, and C. Peltason, editors, State- ment of Interest for the 2nd International Work- shop on Terminological Logics . Document D-91-13 , DFKI Kaiserslautern, 1991.
  14. pBACK . System presentation. In [15), page 186 .
  15. L. Padgham and B. Nebel. Combining classification and nonmonotonic inheritance reasoning: A first step. In Z. W. Ras and J . Komorowski, editors, Methodologies for Intelligent Systems (ISMIS'93). North-Holland, Amsterdam , 1993. To appear.
  16. C. Peltason, K. v. Luck, and C. Kindermann (Org .). Terminological logic users workshop -Proceedings. KIT Report 95, TU Berlin, 1991.
  17. D. L. Poole. A logical framework for default rea- soning. Artificial Intelligence, pages 27-47, 1988.
  18. R. Reiter. A logic for default reasoning. Artificial Intelligence, 13(1-2):81-132, 1980.
  19. R. Reiter and G. Criscuolo. On interacting defaults. In Proceedings of IJCAI'Bl, Vancouver , BC, 1981.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards