Proceedings

A Default Interpretation of Defeasible Network

Download BibTeX Cite

Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 156-160.

© 1997 International Joint Conferences on Artificial Intelligence

Abstract

This paper studies the semantics for the class of all defeasible (inheritance) networks, including cyclic and inconsistent networks using a transformation approach. First we show that defeasible networks can be translated, tractably, to default theories while preserving Horty's pathoff credulous semantics for all consistent networks. Using the existing methods in dealing with the semantics of default logic, we are able to provide a tractable skeptical semantics, the well-founded semantics, and a new credulous semantics, the regular semantics, both of which are defined for any defeasible network. Furthermore, we show that these semantics are based on the same principle of specificity used by Horty in defining his credulous semantics of defeasible networks.

  1. [Baral and Subrahmanian, 1991] C . Baral and V. Sub- rahmanian . Dualities between alternative semantics for logic programming and nonmonotonic reasoning. In Proc. of the First International Workshop on LP- NMR, pages 69-86. MIT Press, 1991.
  2. [Dung and Son, 1995] P. Dung and T. Son. Non- monotonic inheritance, argumentation and logic pro- gramming. In Proc. of 3rd International Conference on LPNMR, pages 317-329, 1995.
  3. [Dung and Son, 1996] P. Dung and T . Son. An argument-theoretic approach to reasoning with speci- ficity . In KR-96, pages 506-528 , 1996.
  4. [Etherington and Reiter, 1983] D. Etherington and R. Reiter. On inheritance hier- archies with exceptions. In AAAI-83, pages 104-108.
  5. Morgan Kaufmann, 1983.
  6. [Gelfand and Przymusinska, 1990] M. Gelfond and H. Przymusinska. Formalization of inheritance reasoning in autoepistemic logic. Funda- mental Informaticae, Xlll:403-443, 1990.
  7. [Gregorie, 1989] E. Gregorie. Skeptical theories of in- heritance and nonmonotonic logics. Methodologies for Intelligence System, 4:43D-438, 1989.
  8. [Haugh, 1988] B. Haugh. Tractable theories of multiple defeasible inheritance in ordinary non-monotonic log- ics. In AAAI-88, pages 421-426. AAAI Press, 1988.
  9. [Horty, 1994] J .F. Horty. Some direct theories of non- monotonic inheritance. In M. Cabbay, C. Hogger, and J . Robinson, editors, Handbook of Logic in Artifi- cial Intelligence and Logic Programming, Vol 3: Non- monotonic Reasoning and Uncertain Reasoning, pages 111-187. Oxford University, 1994.
  10. [Kautz and Selman, 1991] H. Kautz and B. Selman. Hard problems for simple default logics. Artificial In- telligence, pages 243-279, 1991.
  11. [Lin, 1991] F. Lin. A study of nonmonotonic reasoning . PhD thesis, Stanford University, 1991.
  12. [Przymusinska and Przymusinski, 1991] H. Przymusin- ska and T .C. Przymusinski. Stationary default exten- sions. Technical Report, California State Polytechnic and University of California at Riverside, 1991.
  13. [Reiter and Cirscuolo, 1987] R. Reiter and G . Cirscuolo. On interacting defaults. In Readings in Nonmonotonic • Reasoning, pages 94-100.
  14. Morgan Kaufmann, 1987.
  15. [Reiter, 1980] R. Reiter. A logic for default reasoning. Artificial Intelligence, 13:81-132, 1980.
  16. [Selman and Levesque, 1993] B . Selman and H. Levesque. The complexity of path-based defeasi- ble inheritance. Artificial Intelligence, 62(2):303-340, 1993.
  17. [Touretzky, 1986] D. Touretzky. The Mathematics of In- heritance Systems. Morgan Kaufmann, 1986.
  18. [Van Gelder et al., 1991] Van Gelder, A. Ross, and J.S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620-650, 1991.
  19. [You and Yuan, 1995] J . You and L. Yuan. On the equivalence of semantics for normal logic programs. J. Logic Progmmming, 22:212-221, 1995.

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

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