Skip to main content
SpringerLink
Log in

Prototypes for Reasoning with Infinite Stable Models and Function Symbols

  • Conference paper
  • First Online:
Logic Programming and Nonmotonic Reasoning (LPNMR 2001)

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

Abstract

A recent paper [1] laid out the theoretical basis for effective reasoning with infinite stable models and normal programs with function symbols. For the class of finitary programs introduced there, ground queries are decidable and nonground queries are semi-decidable under both credulous and skeptical stable model semantics. Finitary programs are expressive enough to simulate any given Turing machine. In order to exploit the potential expressiveness of finitary programs, a family of tools is needed, including:

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. P. A. Bonatti. Reasoning with infinite stable models. In Proc. of IJCAI’01, 2001. 416, 418

    Google Scholar 

  2. P. A. Bonatti. Resolution for skeptical stable model semantics. Journal of Automated Reasoning, to appear. Preliminary version in Proc. of LPNMR’97, Springer, 1997. 416, 418

    Google Scholar 

  3. S. Decorte, D. de Schreye, M. Fabris. Exploiting the Power of Typed Norms in Automatic Inference of Interargument Relations. Technical report, Department of Computer Science, K. U.Leuven, Belgium, 1994.

    Google Scholar 

  4. I. Niemelä, P. Simons. Smodels-an implementation of the stable model and wellfounded semantics for normal LP. In Proc. of LPNMR’97, LNAI 1265, Springer Verlag, Berlin, 1997. 416

    Google Scholar 

  5. Tommi Syrjänen. Omega-Restricted Logic Programs. This book. 417, 419

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Tecnologie dell’Informazione, Università di Milano, Italy

    Piero A. Bonatti

Authors
  1. Piero A. Bonatti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informationssysteme, Vienna University of Technology, 1040, Wien, Austria

    Thomas Eiter

  2. Institut für Informationssysteme, Vienna University of Technology, 1040, Wien, Austria

    Wolfgang Faber

  3. Department of Computer Science Lexington, University of Kentucky, KY, 40506-0046, USA

    Miros law Truszczyński

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bonatti, P.A. (2001). Prototypes for Reasoning with Infinite Stable Models and Function Symbols. In: Eiter, T., Faber, W., Truszczyński, M.l. (eds) Logic Programming and Nonmotonic Reasoning. LPNMR 2001. Lecture Notes in Computer Science(), vol 2173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45402-0_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-45402-0_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42593-9

  • Online ISBN: 978-3-540-45402-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation