Advertisement

Infinitary default logic for specification of nonmonotonic reasoning

  • Joeri Engelfriet
  • V. Wiktor Marek
  • Jan Treur
  • Mirosław Truszczyński
Default Logics
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1126)

Abstract

In this paper we study constructions leading to the formation of belief sets by agents. We focus on the situation when possible belief sets are built incrementally in stages. We call an infinite sequence of theories that represents such a process a reasoning trace. A set of reasoning traces describing all possible reasoning scenarios for the agent is called a reasoning frame. Default logic by Reiter is not powerful enough to represent reasoning frames. In the paper we introduce a generalization of default logic of Reiter by allowing infinite sets of justifications. We call this formalism infinitary default logic. In the main result of the paper we show that every reasoning frame can be represented by an infinitary default theory. A similar representability result for antichains of theories (belief frames) is also presented.

Keywords

default logic extensions infinitary default logic representability 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [EHT95]
    J. Engelfriet, H. Herre and J. Treur. Nonmonotonic Belief State Frames and Reasoning Frames (extended abstract). In C. Froidevaux, J. Kohlas (eds), Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty, Lecture Notes in Artificial Intelligence, Vol. 946, Springer-Verlag, 1995, pp. 189–196.Google Scholar
  2. [EHT96]
    J. Engelfriet, H. Herre and J. Treur. Nonmonotonic Reasoning with Multiple Belief Sets. In D.M. Gabbay, H.J. Ohlbach (eds), Proceedings of the International Conference on Formal and Applied Practical Reasoning, Lecture Notes in Artificial Intelligence, Vol. 1085, Springer-Verlag,1996, pp. 331–344.Google Scholar
  3. [ET96]
    J. Engelfriet and J. Treur. Specification of Nonmonotonic Reasoning. In D.M. Gabbay, H.J. Ohlbach (eds), Proceedings of the International Conference on Formal and Applied Practical Reasoning, Lecture Notes in Artificial Intelligence, Vol. 1085, Springer-Verlag, 1996, pp. 111–125.Google Scholar
  4. [Fer91]
    A. Ferry. Enriched nonmonotonic rule system. Master of Science Dissertation, University of Kentucky, 1991.Google Scholar
  5. [MT93]
    W. Marek and M. Truszczyński. Nonmonotonic logics; context-dependent reasoning. Berlin: Springer-Verlag, 1993.Google Scholar
  6. [MTT96]
    W. Marek, J. Treur, and M. Truszczyňski. Representability by default theories. In Proceedings of the Fourth International Symposium on Artificial Intelligence and Mathematics, 1996.Google Scholar
  7. [Rei80]
    R. Reiter. A logic for default reasoning. Artificial Intelligence, 13:81–132, 1980.CrossRefGoogle Scholar
  8. [Sch92]
    T. Schaub. On constrained default theories. In B. Neumann (ed.), Proceedings of the European Conference on Artificial Intelligence, 1992, pp. 304–308Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Joeri Engelfriet
    • 1
  • V. Wiktor Marek
    • 2
  • Jan Treur
    • 1
  • Mirosław Truszczyński
    • 2
  1. 1.Department of Mathematics and Computer Science, Artificial Intelligence GroupFree University AmsterdamHV AmsterdamThe Netherlands
  2. 2.Department of Computer ScienceUniversity of KentuckyLexingtonUSA

Personalised recommendations