Skip to main content

Nonmonotonicity and answer set inference

  • Conference paper
  • First Online:
Logic Programming and Nonmonotonic Reasoning (LPNMR 1995)

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

Abstract

The study of abstract properties of nonmonotonic inference has thrown up a number of general conditions on inference relations that are often thought to be desirable, and sometimes even essential, for an adequate system of nonmonotonic reasoning. However, several of the key conditions on inference that have been proposed in the literature make explicit reference to the classical concept of logical consequence, and there is a general tendency to focus attention on inference operations that are supraclassical in the sense of extending classical consequence. Against this trend I argue for the importance of systems that are not supraclassical. I suggest that their inference relations should measure up to adequacy conditions that are more sensitive to the style of reasoning for which they are intended, and which take account of the underlying logic of the monotonic subsystem, if such a subsystem can be identified. I illustrate these points by considering some properties of the inference relation associated with the answer set semantics of extended disjunctive databases.

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. Aiello, L, Amati, G, & Pirri, F, Intuitionistic Autoepistemic Logic, forthcoming in Studia Logica.

    Google Scholar 

  2. Dix, J, Nichtmonotones Schlieβen und dessen Anwendung auf Semantiken logischer Programme, Doctoral Disseration, Karlsruhe, 1992.

    Google Scholar 

  3. Dietrich, J, Deductive Bases of Nonmonotonic Inference Operations, NTZ Report, Universität Leipzig, 1994.

    Google Scholar 

  4. Dietrich, J & Herre, H, Outline of Nonmonotonic Model Theory, NTZ Report, Universität Leipzig, 1994.

    Google Scholar 

  5. Fischer Servi, G, Non-Monotonic Consequence Based on Intuionistic Logic, AILA Preprint, Padova, 1991.

    Google Scholar 

  6. Gabbay, D, Intuitionistic Basis for Non-Monotonic Logic, in Proc 6th Conf on Automated Deduction, LNCS 138, Springer-Verlag, 1982, 260–273.

    Google Scholar 

  7. Gabbay, D, Theoretical Foundations for Non-Monotonic Reasoning in Expert Systems, in K Apt (ed), Logics and Models of Concurrent Systems, Springer-Verlag, 1985.

    Google Scholar 

  8. Gelfond, M, Logic Programming and Reasoning with Incomplete Information, Ann Math and AI 12 (1994), 89–116.

    Google Scholar 

  9. Gelfond, M, & Lifschitz, V, The Stable Model Semantics for Logic Programs, in K Bowen & R Kowalski (eds), Proc 5th Int Conf on Logic Programming 2, MIT Press, 1070–1080.

    Google Scholar 

  10. Gelfond, M, & Lifschtz, V, Classical Negation in Logic Programs and Disjunctive Databases, New Generation Computing (1991), 365–387.

    Google Scholar 

  11. Gurevich, Y, Intuitionistic Logic with Strong Negation, Studia Logica 36 (1977), 49–59.

    Google Scholar 

  12. Herre, H, Compactness Properties of Nonmonotonic Inference Operations, in C MacNish, D Pearce & L M Pereira (eds), Logics in Artificial Intelligence. Proceedings JELIA '94, LNAI 838, Springer-Verlag, 1994.

    Google Scholar 

  13. Kraus, S, Lehmann, D, & Magidor, M, Nonmonotonic Reasoning, Preferential Models and Cumulative Logics, Artificial Intelligence 44 (1990), 167–207.

    Google Scholar 

  14. Makinson, D, General Theory of Cumulative Inference, in M Reinfrank et al (eds), Non-Monotonic Reasoning, LNAI 346, Springer-Verlag, 1989.

    Google Scholar 

  15. Makinson, D, General Patterns in Nonmonotonic Reasoning, in D Gabbay, C J Hogger & J A Robinson (eds), Handbook of Logic in Artificial Intelligence, Clarendon Press, Oxford, 1994.

    Google Scholar 

  16. McCarty, L T, & van der Meyden, R, An Intuitionistic Interpretation of Finite and Infinite Failure, in Pereira, L M, & Nerode, A, (eds), Logic Programming and Non-Monotonic Reasoning, MIT Press, 1993. 417–436.

    Google Scholar 

  17. Pearce, D, Default Logic and Constructive Logic, in B Neumann (ed), Proc ECAI 92, John Wiley, 1992.

    Google Scholar 

  18. Pearce, D, Answer Sets and Constructive Logic, I: Monotonic Databases, in A Fuhrmann & H Rott (eds), Logic, Action and Change, De Gruyter, Berlin, 1994.

    Google Scholar 

  19. Pearce, D, Answer Sets and Nonmonotonic S4, in R. Dyckhoff (ed), Extensions of Logic Programming, LNAI 798, Springer-Verlag, 1994.

    Google Scholar 

  20. Pereira, L M, Alferes, J J, & Aparicio, J N, Default Theory for Well Founded Semantics with Explicit Negation, in D Pearce & G Wagner (eds), Logics in AI. Proc JELIA 92, LNAI 475, Springer-Verlag, 1992, 339–356.

    Google Scholar 

  21. Reiter, R, A Logic for Default Reasoning, Artificial Intelligence 13 (1980), 81–132.

    Google Scholar 

  22. Turner, R, Logics for Artificial Intelligence, Ellis Horwood, 1984.

    Google Scholar 

  23. Wòjcicki, R, Theory of Logical Calculi, Kluwer, Dordrecht, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

V. Wiktor Marek Anil Nerode M. Truszczyński

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pearce, D. (1995). Nonmonotonicity and answer set inference. In: Marek, V.W., Nerode, A., Truszczyński, M. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 1995. Lecture Notes in Computer Science, vol 928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59487-6_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-59487-6_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59487-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics