Skip to main content
SpringerLink
Log in

Autoepistemic logic of first order and its expressive power

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

We study the expressive power of first-order autoepistemic logic. We argue that full introspection of rational agents should be carried out by minimizing positive introspection and maximizing negative introspection. Based on full introspection, we propose the maximal well-founded semantics that characterizes autoepistemic reasoning processes of rational agents, and show that breadth of the semantics covers all theories in autoepistemic logic of first order, Moore's AE logic, and Reiter's default logic. Our study demonstrates that the autoepistemic logic of first order is a very powerful framework for nonmonotonic reasoning, logic programming, deductive databases, and knowledge representation.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Baral, C. R. and Subrahmanian, V. S.: Dualities between alternative semantics for logic programming and nonmonotonic reasoning,Journal of Automated Reasoning 10 (1993), 399–420.

    Google Scholar 

  2. Baral, C. R. and Subrahmanian, V. S.: Stable and extension class theory for logic programs and default logics,Journal of Automated Reasoning 8 (1992), 345–366.

    Google Scholar 

  3. Dung, P. M.: Negations as hypotheses: an abductive foundation for logic programming, inProceedings of the 8th International Conference on Logic Programming, The MIT Press, 1991, pp. 3–17.

  4. Gelder van, A.: The alternating fixpoints of logic programs with negation, inProceedings of the 8th ACM PODS, 1989, pp. 1–10.

  5. Gelder van, A., Ross, K., and Schlipf, J.: The well-founded semantics for general logic programs,JACM 38 (1991), 620–650.

    Google Scholar 

  6. Gelfond, M.: On stratified autoepistemic theories, inProceedings of AAAI-87, Morgan Kaufmann Publishers, 1987, pp. 207–211.

  7. Gelfond, M. and Lifschitz, V.: Logical programs with classical negation, inProceedings of the 7th International Conference on Logic Programming, The MIT Press, 1990, pp. 579–597.

  8. Gelfond, M. and Lifschitz, V.: The stable model semantics for logic programming, inProc. of the 5th International Conference and Symposium on Logic Programming, The MIT Press, 1988, pp. 1070–1080.

  9. Hu, Y. and Yuan, L. Y.: Extended well founded semantics for logic programs with negations, inProceedings of the 8th International Conference on Logic Programming, The MIT Press, 1991, pp. 412–425.

  10. Hughes, G. E. and Cresswell, M. J.:Introduction to Modal Logic, Routledge, 1968.

  11. Konolige, K.: Ideal introspective belief, inProceedings of the AAAI-92, Morgan Kaufmann Publishers, 1992, pp. 635–641.

  12. Konolige, K.: On the relationship between default and autoepistemic logic,Artificial Intelligence 35 (1988), 343–382.

    Google Scholar 

  13. Lifschitz, V.: Between circumscription and autoepistemic logic.KR'89, 1989, pp. 235–244.

  14. Marek, W. and Subrahmanian, V.S.: The relationship between stable, supported, default and auto-epistemic semantics for general logic programs, inProceedings of the 6th International Conference and Symposium on Logic Programming, The MIT Press, 1989, pp. 600–617. Extended version inTheoretical Computer Science 103 (1992), 365–386.

  15. Marek, W. and Truszczunski, M.: Relating autoepistemic and default logic, inProc. of KR '89, 1989, pp. 276–288.

  16. Moore, R. C.: Semantic considerations on non-monotonic logic,AI 25 (1985), 75–94.

    Google Scholar 

  17. Perlis, D.: Autocircumscription,Artificial Intelligence 36 (1988), 223–236.

    Google Scholar 

  18. Przymusinski, T. C.: Autoepistemic logics of closed world beliefs and logic programming, inProc. of the Workshop on NRLP, 1991, pp. 3–20.

  19. Przymusinski, T. C.: Semantics of disjunctive logic programs and deductive databases, inProc. of the 2nd International Conference on Deductive and Object Oriented Databases, 1991.

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

    Article  Google Scholar 

  21. Schwarz, G.: Bounding introspection in nonmonotonic reasoning,KR '92, 1992, pp. 581–590.

  22. Tiomkin, M. and Kaminski, M.: Nonmonotonic default modal logics, inProc. of TARK 1990, 1990, pp. 73–84.

  23. You, J.-H. and Yuan, L. Y.: On the equivalence of logic program semantics, inProc. of the Workshop on Logic Programs with Incomplete Information, following ILPS '93, 1993, pp. 161–176, also available as Research Report of ISIS-RR-93-E12, Fujitsu Labs (to appear inJ. Logic Programming).

  24. You, J.-H. and Yuan, L. Y.: Three-valued formalization of logic programming: is it needed? inProc. of the 9th ACM PODS, 1990, pp. 172–182.

  25. Yuan, L. Y.: Logic program semantics and circumscription of autoepistemic theories,Information Processing Letters,50 (1994), 159–164.

    Google Scholar 

  26. Yuan, L. Y. and You, J.-H.: Autoepistemic circumscription and logic programs,Journal of Automated Reasoning 10 (1993), 143–160.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, The University of Alberta, T6G 2H1, Edmonton, Canada

    Li-Yan Yuan

Authors
  1. Li-Yan Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research is partially supported by NSERC grant OGP42193.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yuan, LY. Autoepistemic logic of first order and its expressive power. J Autom Reasoning 13, 69–82 (1994). https://doi.org/10.1007/BF00881912

Download citation

  • Received:

  • Issue Date:

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

Key words

Search

Navigation