Skip to main content
SpringerLink
Log in
Book cover

Congress of the Italian Association for Artificial Intelligence

AI*IA 1993: Advances in Artificial Intelligence pp 132–141Cite as

Logic programming and autoepistemic logics: New relations and complexity results

  • Conference paper
  • First Online:

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

Abstract

In recent years, many authors have pointed out the strict correlation between non-Horn logic programs and non-monotonic reasoning. As a result, many studies on the relations between various semantics for negation and non-monotonic logics have appeared in the literature. The analysis of these relations helps understanding the properties of the various systems and allows importing analysis from one formalism into another one. In this paper we show a one-to-one mapping between the positivistic models and moderately-grounded expansions of autoepistemic logic and a one-to-one correspondence between the minimally-supported models and the stable parsimonious expansions. These relations are then used to prove the computational complexity of reasoning with the positivistic and minimally-supported model semantics, as well as new complexity results for restricted subsets of autoepistemic logic.

Work partially supported by the ESPRIT Basic Research Action COMPULOG and the Progetto Finalizzato Informatica & Calcolo Parallelo of the CNR (Italian Research Council)

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. R. Apt, H. A. Blair, and A. Walker. Towards a theory of declarative knowledge. In J. Minker, editor, Foundation of Deductive Databases and Logic Programming, pages 89–142. Morgan Kaufmann, 1988.

    Google Scholar 

  2. N. Bidoit and C. Froidevaux. General logic databases and programs: default logic semantics and stratification. Information and Computation, 91:15–54, 1991.

    Google Scholar 

  3. N. Bidoit and R. Hull. Positivism versus minimalism in deductive databases. In Proceedings of the Fifth Conference on Principle Of Database Systems (PODS-86), pages 123–132, 1986.

    Google Scholar 

  4. N. Bidoit and R. Hull. Minimalism, justification and non-monotonicity in deductive databases. Journal of Computer and System Sciences, 38:290–325, 1989.

    Google Scholar 

  5. K. L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293–322. Plenum, 1978.

    Google Scholar 

  6. T. Eiter and G. Gottlob. Propositional circumscription and extended closed world reasoning are II p2 -complete. Technical Report CD-TR 91/20, Technische Universität Wien, Vienna Austria, Christian Doppler Labor für Expertensysteme, May 1991. To appear in Theoretical Computer Science.

    Google Scholar 

  7. T. Eiter and G. Gottlob. Reasoning with parsimonious and moderately grounded expansions. Fundamenta Informaticae, 17(1,2):31–54, 1992.

    Google Scholar 

  8. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proceedings of the Fifth Logic Programming Symposium, pages 1070–1080. MIT Press, 1988.

    Google Scholar 

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

    Google Scholar 

  10. W. Marek and V. S. Subrahmanian. The relationship between logic program, semantics and non-monotonic reasoning. In Proceedings of the Sixth International Conference on Logic Programming (ICLP-89), pages 600–617, 1989.

    Google Scholar 

  11. W. Marek and M. Truszczyński. Autoepistemic logic. Journal of the ACM, 38(3):588–619, 1991.

    Google Scholar 

  12. W. Marek and M. Truszczyński. Computing intersection of autoepistemic expansions. In Proceedings of the First International Workshop on Logic Programming and Non Monotonic Reasoning, pages 37–50. The MIT press, 1991.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  15. L. J. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science, 3:1–22, 1976.

    Google Scholar 

  16. A. van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38:620–650, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Elettrotecnica, Università di Cagliari, Piazza d'Armi, 09123, Cagliari, Italia

    Marco Schaerf

  2. Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, via Salaria 113, 00198, Roma, Italia

    Marco Schaerf

Authors
  1. Marco Schaerf
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Pietro Torasso

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schaerf, M. (1993). Logic programming and autoepistemic logics: New relations and complexity results. In: Torasso, P. (eds) Advances in Artificial Intelligence. AI*IA 1993. Lecture Notes in Computer Science, vol 728. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57292-9_51

Download citation

  • DOI: https://doi.org/10.1007/3-540-57292-9_51

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57292-3

  • Online ISBN: 978-3-540-48038-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation