Skip to main content
SpringerLink
Log in

Towards First-Order Nonmonotonic Reasoning

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

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

  • 275 Accesses

Abstract

We investigate the problem of reasoning in nonmonotonic extensions of first-order logic. In particular, we study reasoning in firstorder MKNF, the modal logic of minimal knowledge and negation as failure introduced by Lifschitz. MKNF can be considered as a unifying framework for several nonmonotonic formalisms, including default logic, autoepistemic logic, circumscription, and logic programming. By suitably extending deduction methods for propositional nonmonotonic logics, we define techniques for reasoning in significant subsets of first-order MKNF, which allow for characterizing decidable fragments of first-order nonmonotonic modal logics. Due to the expressive abilities of MKNF, such techniques can be seen as general reasoning methods for several nonmonotonic formalisms based on first-order logic. We also analyze the relationship between such decidable fragments of MKNF and disjunctive Datalog.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Beringer and T. Schaub. Minimal belief and negation as failure: a feasible approach. In Proc. of the 11th Nat. Conf. on Artificial Intelligence (AAAI’93), pages 400–405, 1993.

    Google Scholar 

  2. M. Cadoli and M. Schaerf. A survey of complexity results for non-monotonic logics. J. of Logic Programming, 17:127–160, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  3. F. M. Donini, D. Nardi, and R. Rosati. Autoepistemic description logics. In Proc. of the 15th Int. Joint Conf. on Artificial Intelligence (IJCAI’97), pages 136–141, 1997.

    Google Scholar 

  4. F. M. Donini, D. Nardi, and R. Rosati. Ground nonmonotonic modal logics. J. of Logic and Computation, 7(4):523–548, Aug. 1997.

    Article  MATH  MathSciNet  Google Scholar 

  5. T. Eiter and G. Gottlob. Propositional circumscription and extended closed worldreasoning are IIstackp stack2-complete. Theoretical Computer Science, 114:231–245, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  6. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365–385, 1991.

    Article  Google Scholar 

  7. G. Gottlob. Complexity results for nonmonotonic logics. J. of Logic and Computation, 2:397–425, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  8. G. Gottlob. NP trees and Carnap’s modal logic. J. of the ACM, 42(2):421–457, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  9. J. Y. Halpern and Y. Moses. Towards a theory of knowledge and ignorance: Preliminary report. In K. Apt, editor, Logic and models of concurrent systems. Springer-Verlag, 1985.

    Google Scholar 

  10. K. Inoue and C. Sakama. On positive occurrences of negation as failure. In Proc. of the 4th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR’94), pages 293–304. Morgan Kaufmann, Los Altos, 1994.

    Google Scholar 

  11. M. Kaminski. Embedding a default system into nonmonotonic logics. Fundamenta Informaticae, 14:345–354, 1991.

    MATH  MathSciNet  Google Scholar 

  12. K. Konolige. On the relation between autoepistemic logic and circumscription. In Proc. of the 11th Int. Joint Conf. on Artificial Intelligence (IJCAI’89), pages 1213–1218, 1989.

    Google Scholar 

  13. G. Lakemeyer. Limited reasoning in first-order knowledge bases with full introspection. Artificial Intelligence, 84:209–255, 1996.

    Article  MathSciNet  Google Scholar 

  14. H. J. Levesque. All I know: a study of autoepistemic logic. Artificial Intelligence, 42:263–310, 1990.

    Article  MathSciNet  MATH  Google Scholar 

  15. V. Lifschitz. Nonmonotonic databases and epistemic queries. In Proc. of the 12 th Int. Joint Conf. on Artificial Intelligence (IJCAI’91), pages 381–386, Sydney, 1991.

    Google Scholar 

  16. V. Lifschitz. Minimal belief and negation as failure. Artificial Intelligence, 70:53–72, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  17. V. Lifschitz and T. Woo. Answer sets in general nonmonotonic reasoning (preliminary report). In Proc. of the 3rd Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR’92), pages 603–614. Morgan Kaufmann, Los Altos, 1992.

    Google Scholar 

  18. F. Lin and Y. Shoham. Epistemic semantics for fixed-point non-monotonic logics. Artificial Intelligence, 57:271–289, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  19. W. Marek and M. Truszczyński. Nonmonotonic Logics-Context-Dependent Reasoning. Springer-Verlag, 1993.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  21. I. Niemelä. On the decidability and complexity of autoepistemic reasoning. Fundamenta Informaticae, 17(1,2):117–156, 1992.

    MathSciNet  MATH  Google Scholar 

  22. R. Rosati. Reasoning with minimal belief and negation as failure: Algorithms and complexity. In Proc. of the 14th Nat. Conf. on Artificial Intelligence (AAAI’97), pages 430–435. AAAI Press/The MIT Press, 1997.

    Google Scholar 

  23. R. Rosati. Reducing query answering to satisfiability in nonmonotonic logics. In Proc. of the 15th Nat. Conf. on Artificial Intelligence (AAAI’98), pages 853–858. AAAI Press/The MIT Press, 1998.

    Google Scholar 

  24. G. Schwarz. Autoepistemic logic of knowledge. In Proc. of the 1st Int. Workshop on Logic Programming and Non-monotonic Reasoning (LPNMR’91), pages 260–274. The MIT Press, 1991.

    Google Scholar 

  25. G. Schwarz and V. Lifschitz. Extended logic programs as autoepistemic theories. In Proc. of the 2nd Int. Workshop on Logic Programming and Non-monotonic Reasoning (LPNMR’93), pages 101–114. The MIT Press, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, Via Salaria 113, I-00198, Roma, Italy

    Riccardo Rosati

Authors
  1. Riccardo Rosati
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Texas at El Paso, El Paso, TX, 79916, USA

    Michael Gelfond

  2. Institut für Informationssysteme 184/2, Technische Universität Wien, Favoritenstrβe 9-11, A-1040, Vienna, Austria

    Nicola Leone  & Gerald Pfeifer  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rosati, R. (1999). Towards First-Order Nonmonotonic Reasoning. In: Gelfond, M., Leone, N., Pfeifer, G. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 1999. Lecture Notes in Computer Science(), vol 1730. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46767-X_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-46767-X_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66749-0

  • Online ISBN: 978-3-540-46767-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation