Skip to main content

Priorities in Default Logic revisited

  • Conference paper
  • First Online:
Topics in Artificial Intelligence (AI*IA 1995)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 992))

Included in the following conference series:

Abstract

One of the drawbacks of Reiter's original presentation of Default Logic is the difficulty of expressing priorities among defaults. Recently, Brewka proposed an expansion of Default Logic which allows for explicit reasoning about priorities in Default Logic. In this paper we give an alternative, operational characterization of extensions; it is also technically simpler and therefore more easily applicable. Further we investigate some properties of the logic paying special attention to the existence of extensions. We present some sufficient conditions for a default theory with priorities to have at least one extension.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Antoniou and V. Sperschneicler. Operational Interpretation of Nonmonotonic Logics — Part 1: Default Logic. Artificial Intelligence Review, 1994

    Google Scholar 

  2. G. Brewka. Preferred subtheories — an extended logical framework for default reasoning. In Proc. IJCAI-89, 1989

    Google Scholar 

  3. G. Brewka. Adding priorities and specificity to default logic. Technical report GMD, 1993

    Google Scholar 

  4. G. Brewka. Reasoning About Priorities in Default Logic. In Proc. AAAI-94, 1994

    Google Scholar 

  5. H. Geffner and J. Pearl. Conditional entailment: Bridging two approaches to default reasoning. Artificial Intelligence 53, 1992

    Google Scholar 

  6. B. Grsohof. Generalizing prioritization. In Proc. 1st Knowledge Representation and Reasoning, 1991

    Google Scholar 

  7. T. Gordon. The Pleadings Game: An Artificial Intelligence Model for Procedural Justice. Ph.D. Dissertation, Darmstadt 1993

    Google Scholar 

  8. K. Konolige. Hierarchical autoepisteinic theories for nonmonotonic reasoning. In Proc. AAAI-88, 1988

    Google Scholar 

  9. V. Lifschitz. Computing circumscription. In Proc. IJCAI-85, 1985

    Google Scholar 

  10. J. Pearl. System Z: A natural ordering of defaults with tractable applications to nonmonotonic reasoning. In Proc. Third Conference on Theoretical Aspects of Reasoning about Knowledge, 1990

    Google Scholar 

  11. H. Prakken. Logical Tools for Modelling Legal Argument. Ph.D. Dissertation, VU Amsterdam 1993

    Google Scholar 

  12. R. Reiter. A logic for default reasoning. Artificial Intelligence 13, 1980

    Google Scholar 

  13. V. Sperschneider and G. Antoniou. Logic: A Foundation for Computer Science. Addison-Wesley 1991

    Google Scholar 

  14. D.S. Touretzky. The Mathematics of Inheritance. Pitman 1986

    Google Scholar 

  15. D.S. Touretzky, J.F. Horty, and R.H. Thomason. A clash of intuitions: The current state of nonmonotonic multiple inheritance systems. In Proc. IJCAI-87, 1987

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Marco Gori Giovanni Soda

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Antoniou, G. (1995). Priorities in Default Logic revisited. In: Gori, M., Soda, G. (eds) Topics in Artificial Intelligence. AI*IA 1995. Lecture Notes in Computer Science, vol 992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60437-5_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-60437-5_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60437-2

  • Online ISBN: 978-3-540-47468-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics