Skip to main content
SpringerLink
Log in

Prioritized autoepistemic logic

  • Conference paper
  • First Online:
Logics in Artificial Intelligence (JELIA 1994)

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

Included in the following conference series:

Abstract

An important problem in data and knowledge representation is the possibility of default rules that conflict. If the application of both of two default rules leads to a contradiction, they cannot both be applied. Systems that support the use of default rules may either remain indifferent or prioritize one rule over the other. In this paper a prioritized version of autoepistemic logic is presented. Priorities determine a subset of all stable expansions of a set, the preferred stable expansions. The priority notion is declarative, unlike e.g. some recent approaches to priorities in default logic that modify the semi-constructive definition of extensions of Reiter. Computationally the new priority notion can nevertheless be seen as a mechanism for pruning search trees in procedures for autoepistemic reasoning, as demonstrated by procedures given in the paper.

This work was funded by Suomen Akatemia. Additional support from the following foundations is gratefully acknowledged: Emil Aaltosen säätiö, Heikki ja Hilma Honkasen säätiö, Alfred Kordelinin yleinen edistysja sivistysrahasto.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Baader, F. and B. Hollunder: How to prefer more specific defaults in terminological default logic. In Ruzena Bajcsy, editor, Proceedings of the 13th International Joint Conference on Artificial Intelligence, volume 1, pages 669–674, Chambery, France, 1993.

    Google Scholar 

  • Baker, A. B. and M. L. Ginsberg: A theorem prover for prioritized circumscription. In Proceedings of the 11th International Joint Conference on Artificial Intelligence, pages 463–467, Detroit, 1989. Morgan Kaufmann Publishers.

    Google Scholar 

  • Brewka, G.: Preferred subtheories: an extended logical framework for default reasoning. In Proceedings of the 11th International Joint Conference on Artificial Intelligence, pages 1043–1048, Detroit, 1989. Morgan Kaufmann Publishers.

    Google Scholar 

  • Brewka, G.: Specificity in default logic and its application to formalizing obligation. Unpublished, 1992.

    Google Scholar 

  • Geffner, H. and Judea Pearl: Conditional entailment: bridging two approaches to default reasoning. Artificial Intelligence, 53:209–244, 1992.

    Google Scholar 

  • Gelfond, M.: On stratified autoepistemic theories. In Proceedings of the 6th National Conference on Artificial Intelligence, pages 207–211, Seattle, July 1987. American Association for Artificial Intelligence.

    Google Scholar 

  • Gottlob, G.: Complexity results for nonmonotonic logics. Journal of Logic and Computation, 2(3):397–425, June 1992.

    Google Scholar 

  • Junker, U. and G. Brewka: Handling partially ordered defaults in TMS. In Symbolic and quantitative approaches to uncertainty. European Conference, number 548 in Lecture Notes in Computer Science, pages 211–218, Marseille, 1991. Springer-Verlag.

    Google Scholar 

  • Konolige, K.: Hierarchic autoepistemic theories for nonmonotonic reasoning: Preliminary report. In Proceedings of the 2nd Workshop on Non-Monotonic Reasoning, number 346 in Lecture Notes in Artificial Intelligence, pages 42–59, Grassau, Germany, June 1989. Springer-Verlag.

    Google Scholar 

  • Kraus, S., D. Lehmann, and M. Magidor: Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence, 44:167–207, 1990.

    Google Scholar 

  • Lifschitz, V.: Computing circumscription. In A. Joshi, editor, Proceedings of the 9th International Joint Conference on Artificial Intelligence, pages 121–127, Los Angeles, August 1985. Morgan Kaufmann Publishers.

    Google Scholar 

  • MacNish, C.: Hierarchical default logic. In Symbolic and quantitative approaches to uncertainty. European Conference, number 548 in Lecture Notes in Computer Science, pages 246–253, Marseille, 1991. Springer-Verlag.

    Google Scholar 

  • Marek, W. and M. TruszczyÅ„ski: Autoepistemic logic. Journal of the ACM, 38:588–619, 1991.

    Google Scholar 

  • Marek, V. W., G. F. Schwarz, and M. TruszczyÅ„ski: Modal nonmonotonic logics: ranges, characterization, computation. Journal of the ACM, 40(4):963–990, September 1993.

    Google Scholar 

  • McCarthy, J.: Circumscription — a form of non-monotonic reasoning. Artificial Intelligence, 13:27–39, 1980.

    Google Scholar 

  • Moore, R. C.: Semantical considerations on nonmonotonic logic. Artificial Intelligence, 25:75–94, 1985.

    Google Scholar 

  • Niemelä, I. and J. Rintanen: On the impact of stratification on the complexity of nonmonotonic reasoning. In B. Nebel, C. Rich, and W. Swartout, editors, Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning, pages 627–638, Cambridge, MA, October 1992. Morgan Kaufmann Publishers.

    Google Scholar 

  • Niemelä, I.: A decision method for nonmomotonic reasoning based on autoepistemic reasoning. In Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning, Bonn, May 1994. To appear.

    Google Scholar 

  • Niemelä, I.: Towards automatic autoepistemic reasoning. In J. Van Eijck, editor, Proceedings of the European Workshop on Logics in Artificial Intelligence-JELIA'90, number 478 in Lecture Notes in Artificial Intelligence, pages 428–443, Amsterdam, September 1990. Springer-Verlag.

    Google Scholar 

  • Przymusinska, H.: The embeddability of hierarchic autoepistemic logic in autoepistemic logic. In Z. W. Ras, editor, Methodologies for Intelligent Systems, 4: Proceedings of the Fourth International Symposium on Methodologies for Intelligent Systems, pages 485–493, New York, 1989. North-Holland.

    Google Scholar 

  • Reiter, R. and G. Criscuolo: On interacting defaults. In Proceedings of the 7th International Joint Conference on Artificial Intelligence, pages 270–276, 1981.

    Google Scholar 

  • Reiter, R.: A logic for default reasoning. Artificial Intelligence, 13:81–132, 1980.

    Google Scholar 

  • Reiter, R.: A theory of diagnosis from first principles. Artificial Intelligence, 32:57–95, 1987.

    Google Scholar 

  • Rintanen, J.: Priorities and nonmonotonic reasoning. Research report A 28, Helsinki University of Technology, Digital Systems Laboratory, December 1993.

    Google Scholar 

  • Ryan, M.: Representing defaults as sentences with reduced priority. In B. Nebel, C. Rich, and W. Swartout, editors, Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning, pages 649–660, Cambridge, MA, October 1992. Morgan Kaufmann Publishers.

    Google Scholar 

  • Shoham, Y.: Nonmonotonic logics: meaning and utility. In D. McDermott, editor, Proceedings of the 10th International Joint Conference on Artificial Intelligence, pages 388–393, Milano, 1987.

    Google Scholar 

  • Shvarts, G.: Autoepistemic modal logics. In Proceedings of the 3rd Conference on Theoretical Aspects of Reasoning about Knowledge, pages 97–109, Pacific Grove, CA, March 1990. Morgan Kaufmann Publishers.

    Google Scholar 

  • Tan, Y. H. and J. Treur: Constructive default logic and the control of defeasible reasoning. In B. Neumann, editor, Proceedings of the 10th European Conference on Artificial Intelligence, pages 299–303, Vienna, 1992. John Wiley & Sons.

    Google Scholar 

  • Touretzky, D. S., J. F. Horty, and R. H. Thomason: A clash of intuitions: the current state of nonmonotonic multiple inheritance systems. In D. McDermott, editor, Proceedings of the 10th International Joint Conference on Artificial Intelligence, pages 476–482, Milano, August 1987. Morgan Kaufmann Publishers.

    Google Scholar 

  • Toyama, K., Y. Inagaki, and T. Fukumura: Knowledge representation based on autoepistemic logic for multiple agents. Technical report 90-1-06, Chukyo University, School of Computer and Cognitive Sciences, March 1991.

    Google Scholar 

  • TruszczyÅ„ski, M.: Embedding default logic into modal nonmonotonic logics. In Proceedings of the 1st International Workshop on Logic Programming and Non-monotonic Reasoning, pages 151–165, Washington, DC, July 1991. The MIT Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Helsinki University of Technology, Otakaari 1, 02150, Espoo, Finland

    Jussi Rintanen

Authors
  1. Jussi Rintanen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Craig MacNish David Pearce Luís Moniz Pereira

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rintanen, J. (1994). Prioritized autoepistemic logic. In: MacNish, C., Pearce, D., Pereira, L.M. (eds) Logics in Artificial Intelligence. JELIA 1994. Lecture Notes in Computer Science, vol 838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021976

Download citation

  • DOI: https://doi.org/10.1007/BFb0021976

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58332-5

  • Online ISBN: 978-3-540-48657-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation