Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Logical Foundations of Computer Science

LFCS 2007: Logical Foundations of Computer Science pp 379–400Cite as

Compactness Properties for Stable Semantics of Logic Programs

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4514))

Abstract

Logic programming with stable logic semantics (SLP) is a logical formalism that assigns to sets of clauses in the language admitting negations in the bodies a special kind of models, called stable models. This formalism does not have the compactness property. We show a number of conditions that entail a form of compactness for SLP.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Apt, K.: Logic programming. In: van Leeuven, J. (ed.) Handbook of Theoretical Computer Science, pp. 493–574. MIT Press, Cambridge (1990)

    Google Scholar 

  2. Apt, K.R., Blair, H.A.: Arithmetical Classification of Perfect Models of Stratified Programs. Fundamenta Informaticae 13, 1–17 (1990)

    MathSciNet  MATH  Google Scholar 

  3. Apt, K., Blair, H., Walker, A.: Towards a Theory of Declarative Knowledge. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 89–142. Morgan Kaufmann, Los Altos (1987)

    Google Scholar 

  4. Babovich, Y., Lifschitz, V.: Cmodels (2002), http://www.cs.utexas.edu/users/tag/cmodels.html

  5. Bonatti, P.A.: Resolution for Skeptical Stable Model Semantics. Journal of Automated Reasoning 27, 391–421 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cenzer, D., Remmel, J.B.: Index Sets for \(\Pi^0_1\)-classes. Annals of Pure and Applied Logic 93, 3–61 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  7. Cenzer, D., Remmel, J.B.: \(\Pi^0_1\)-classes in Mathematics. In: Ershov, Y.L., Goncharov, S.S., Nerode, A., Remmel, J.B. (eds.) Handbook of Recursive Mathematics: Volume 2. Studies in Logic and the Foundations of Mathematics, vol. 139, pp. 623–822. Elsevier, Amsterdam (1998)

    Chapter  Google Scholar 

  8. Cenzer, D., Remmel, J.B., Vanderbilt, A.: Locally Determined Logic Programs. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol. 1730, pp. 34–49. Springer, Heidelberg (1999)

    Google Scholar 

  9. Cholewiński, P.: Stratified default theories. In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol. 933, Springer, Heidelberg (1995)

    Google Scholar 

  10. Dung, P.M., Kanchanasut, K.: A Fixpoint Approach to Declarative Semantics of Logic Programs. In: Lusk, E.L., Overbeek, R.A. (eds.) Logic Programming, Proceedings of North American Conference, pp. 604–625 (1989)

    Google Scholar 

  11. Ferry, A.: A topological characterization of the stable and minimal model classes of propositional logic programs. Ann. Math. Artificial Intelligence 15, 325–355 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  12. Gelfond, M., Lifschitz, V.: The Stable Semantics for Logic Programs. In: Proceedings of the 5th International Symposium on Logic Programming, pp. 1070–1080. MIT Press, Cambridge (1988)

    Google Scholar 

  13. Gödel, K.: Über formal unentscheibare Sätze der Principia Mathemaica und verwandter Systeme I. Monatshefte Math. Phys. 38, 173–198 (1931)

    Article  Google Scholar 

  14. Jockusch, C.G., Soare, R.I.: \(\pi_1^0\) Classes and Degrees of Theories. Transactions of American Mathematical Society 173, 33–56 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  15. Lifschitz, V., Turner, H.: Splitting a logic program. In: Van Hentenryck, P. (ed.) Proceedings of the Eleventh International Conference on Logic Programming, pp. 23–37 (1994)

    Google Scholar 

  16. Lloyd, J.: Foundations of Logic Programming. Springer, Heidelberg (1989)

    Google Scholar 

  17. Marek, W., Nerode, A., Remmel, J.B.: Nonmonotonic Rule Systems I. Annals of Mathematics and Artificial Intelligence 1, 241–273 (1990)

    Article  MATH  Google Scholar 

  18. Marek, W., Nerode, A., Remmel, J.B.: Nonmonotonic Rule Systems II. Annals of Mathematics and Artificial Intelligence 5, 229–264 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  19. Marek, W., Nerode, A., Remmel, J.B.: A Context for Belief Revision: Normal Logic Programs (Extended Abstract). In: Proceedings, Workshop on Defeasible Reasoning and Constraint Solving, International Logic Programming Symposium, San Diego, CA (1991)

    Google Scholar 

  20. Marek, W., Nerode, A., Remmel, J.B.: How Complicated is the Set of Stable Models of a Logic Program? Annals of Pure and Applied Logic 56, 119–136 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  21. Marek, W., Nerode, A., Remmel, J.B.: The stable models of predicate logic programs. Journal of Logic Programming 21, 129–154 (1994)

    MathSciNet  MATH  Google Scholar 

  22. Marek, W., Nerode, A., Remmel, J.B.: Context for belief revision: Forward chaining-normal nonmonotonic rule systems. Annals of Pure and Applied Logic 67, 269–324 (1994)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  24. Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138, 181–234 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  25. Van Gelder, A., Ross, K.A., Schlipf, J.S.: Unfounded sets and well-founded semantics for general logic programs. Journal of the ACM 38, 587 (1991)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Victor W. Marek

  2. Department of Mathematics, University of California at San Diego, La Jolla, CA 92093,  

    Jeffrey B. Remmel

Authors
  1. Victor W. Marek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jeffrey B. Remmel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Sergei N. Artemov Anil Nerode

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Marek, V.W., Remmel, J.B. (2007). Compactness Properties for Stable Semantics of Logic Programs. In: Artemov, S.N., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 2007. Lecture Notes in Computer Science, vol 4514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72734-7_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72734-7_27

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-72734-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation