Skip to main content

Revised Stable Models – A Semantics for Logic Programs

  • Conference paper

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

Abstract

This paper introduces an original 2-valued semantics for Normal Logic Programs (NLP), which conservatively extends the Stable Model semantics (SM) to all normal programs. The distinction consists in the revision of one feature of SM, namely its treatment of odd loops, and of infinitely long support chains, over default negation. This single revised aspect, addressed by means of a Reductio ad Absurdum approach, affords a number of fruitful consequences, namely regarding existence, relevance and top-down querying, cumulativity, and implementation.

The paper motivates and defines the Revised Stable Models semantics (rSM), justifying and exemplifying it. Properties of rSM are given and contrasted with those of SM. Furthermore, these results apply to SM whenever odd loops and infinitely long chains over negation are absent, thereby establishing significant, not previously known, properties of SM. Conclusions, further work, terminate the paper.

Keywords

  • Logic program semantics
  • Stable Models
  • Reductio ad absurdum

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alferes, J.J., Brogi, A., Leite, J.A., Pereira, L.M.: Evolving Logic Programs. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 50–61. Springer, Heidelberg (2002)

    CrossRef  Google Scholar 

  2. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K.A. (eds.) 5th Intl. Logic Programming Conf., pp. 1070–1080. MIT Press, Cambridge (1988)

    Google Scholar 

  3. Dix, J.: A Classification Theory of Semantics of Normal Logic Programs: I. Strong Properties, II. Weak Properties. Fundamenta Informaticae XXII(3)*, 227–255, 257–288 (1995)

    Google Scholar 

  4. van Gelder, A., Ross, K.A., Schlipf, J.S.: The Well-Founded Semantics for General Logic Programs. J. ACM 38(3), 620–650 (1991)

    MATH  Google Scholar 

  5. Fages, F.: Consistency of Clark’s Completion and Existence of Stable Models. Methods of Logic in Computer Science 1, 51–60 (1994)

    Google Scholar 

  6. van Gelder, A.: The Alternating Fixpoint of Logic Programs with Negation. Journal of computer and system sciences 47, 185–221 (1993)

    CrossRef  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pereira, L.M., Pinto, A.M. (2005). Revised Stable Models – A Semantics for Logic Programs. In: Bento, C., Cardoso, A., Dias, G. (eds) Progress in Artificial Intelligence. EPIA 2005. Lecture Notes in Computer Science(), vol 3808. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11595014_4

Download citation

  • DOI: https://doi.org/10.1007/11595014_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30737-2

  • Online ISBN: 978-3-540-31646-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics