Skip to main content
SpringerLink
Log in
Book cover

The Logic Programming Paradigm pp 375–398Cite as

Stable Models and an Alternative Logic Programming Paradigm

  • Chapter

Part of the book series: Artificial Intelligence ((AI))

Summary

In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate that inherent features of stable model semantics naturally lead to a logic programming system that offers an interesting alternative to more traditional logic programming styles of Horn logic programming, stratified logic programming and logic programming with well-founded semantics. The proposed approach is based on the interpretation of program clauses as constraints. In this setting, a program does not describe a single intended model, but a family of its stable models. These stable models encode solutions to the constraint satisfaction problem described by the program. Our approach imposes restrictions on the syntax of logic programs. In particular, function symbols are eliminated from the language. We argue that the resulting logic programming system is well-attuned to problems in the class NP, has a well-defined domain of applications, and an emerging methodology of programming. We point out that what makes the whole approach viable is recent progress in implementations of algorithms to compute stable models of propositional logic programs.

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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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. J.J. Alferes, C.V. Damásio and L.M. Pereira. A logic programming system for nonmonotonic reasoning. Journal of Automated Reasoning, 14:93–147, 1995

    Article  MathSciNet  MATH  Google Scholar 

  2. K. Apt and H.A. Blair. Arithmetical classification of perfect models of stratified programs. Fundamenta Informaticae, 12:1–17, 1990

    MathSciNet  Google Scholar 

  3. K. Apt, H.A. Blair, and A. Walker. Towards a theory of declarative knowledge. In J. Minker, editor, Foundations of deductive databases and logic programming, pages 89–142, Los Altos, CA, 1988. Morgan Kaufmann

    Google Scholar 

  4. F. Afrati, S. Cosmodakis, and M. Yannakakis. On DATALOG vs. polynomial time. In Proceedings of PODS’91, pages 13–25, 1991

    Google Scholar 

  5. C. Aravindan, J. Dix, and I. Niemelä. Dislop: Toward a disjunctive logic programming system. In Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 341–352, 1997. Springer LN in Computer Science 1265

    Google Scholar 

  6. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley Publishing Company, 1995

    MATH  Google Scholar 

  7. H. Andreka and I. Nemeti. The generalized completeness of Horn predicate logic as a programming language. Acta Cybernetica, 4:3–10, 1978.

    MathSciNet  MATH  Google Scholar 

  8. K.R. Apt and M.H. van Emden. Contributions to the theory of logic programming. Journal of the ACM, 29:841–862, 1982

    Article  MATH  Google Scholar 

  9. N.Bidoit and C. Froidevaux. Negation by default and unstratifiable logic programs. Theoretical Computer Science, 78:85–112, 1991

    Article  MathSciNet  MATH  Google Scholar 

  10. H.A. Blair, W. Marek, and J. Schlipf. The expressiveness of locally stratified programs. Annals of Mathematics and Artificial Intelligence, 15:209–229, 1995

    Article  MathSciNet  MATH  Google Scholar 

  11. P. Cholewinski. Automated reasoning with Default Logic. PhD thesis, University of Kentucky, 1996. Ph.D. Thesis.

    Google Scholar 

  12. A. Colmerauer, H. Kanoui, R. Pasero, and P. Roussel. Un système de communication homme-machine en frangais. Technical report, University of Marseille, 1973.

    Google Scholar 

  13. C.-L. Chang and C.-T. Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, 1973

    MATH  Google Scholar 

  14. K.L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and data bases, pages 293–322. Plenum Press, 1978

    Google Scholar 

  15. P. Cholewiński, W. Marek, A. Mikitiuk, and M. Truszczyński. Experimenting with nonmonotonic reasoning. In Proceedings of the 12th International Conference on Logic Programming, pages 267–281. MIT Press, 1995

    Google Scholar 

  16. P. Cholewiński, W. Marek, A. Mikitiuk, and M. Truszczyński. Programming with default logic. Submitted for publication, 1998

    Google Scholar 

  17. P. Cholewiński, W. Marek, and M. Truszczyński. Default reasoning system DeReS. In Proceedings of KR-96, pages 518–528. Morgan Kaufmann, 1996

    Google Scholar 

  18. M. Cadoli and L. Palipoli. Circumscribing datalog: expressive power and complexity. Theoretical Computer Science, 193:215–244, 1998

    Article  MathSciNet  MATH  Google Scholar 

  19. M. Cadoli, L. Palipoli, A. Schaerf, and D. Vasile. Np-spec: An executable specification language for solving all problems in np. Unpublished manuscript, 1998.

    Google Scholar 

  20. O. Dubois, P. Andre, Y. Boufkhad, and J. Carlier. Sat versus unsat. In Cliques, Coloring and Satisfiability, Second DIM ACS Implementation Challenge, pages 415–436. American Mathematical Society, 1996

    Google Scholar 

  21. T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. A deductive system for non-monotonic reasoning. In Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 363–374, 1997. Springer LN in Computer Science 1265

    Google Scholar 

  22. T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. The KR System dlv: Progress Report, Comparisons, and Benchmarks. In Proceedings Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR-98), pages 406–417, June 2–4 1998

    Google Scholar 

  23. M.R. Garey and D.S. Johnson. Computers and intractability; a guide to the theory of NP-completeness. W.H. Freeman, 1979

    MATH  Google Scholar 

  24. M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In Proceedings of the 5th International Symposium on Logic Programming, pages 1070–1080, Cambridge, MA, 1988. MIT Press

    Google Scholar 

  25. J. Herbrand. Recherches sur la théorie de la démonstrations. PhD thesis, Paris, 1930

    Google Scholar 

  26. M. Kaminski. A note on stable semantics for logic programs. Artificial Intelligence Journal, 96:467–479, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  27. R. Kowalski. Predicate logic as a programming language. In Proceedings of IFIP 74, pages 569–574, Amsterdam, 1974. North Holland

    Google Scholar 

  28. R. Kowalski. Logic for Problem Solving. North Holland, Amsterdam, 1979.

    MATH  Google Scholar 

  29. V. Lifschitz. Action languages, answer sets and planning. This volume.

    Google Scholar 

  30. J. Lloyd. Foundations of logic programming. Berlin: Springer-Verlag, 1984.

    MATH  Google Scholar 

  31. D. Loveland. Automated Theorem Proving: A Logical Basis. North Holland, 1978.

    MATH  Google Scholar 

  32. J.W. Lloyd and R.W. Topor. Making prolog more expressive. Journal of Logic Programming, l (3):225–240, 1984

    Article  MathSciNet  Google Scholar 

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

    MathSciNet  Google Scholar 

  34. W. Marek and M. Truszczyński. Stable semantics for logic programs and default theories. In Proceedings of the North American Conference on Logic Programming, pages 243–256. MIT Press, 1989

    Google Scholar 

  35. W. Marek and M. Truszczyński. Autoepistemic logic. Journal of the ACM, 38:588–619, 1991

    Article  MATH  Google Scholar 

  36. W. Marek and M. Truszczyński. Nonmonotonic Logic - Context- Dependent Reasoning. Series Artificial Intelligence, Springer-Verlag, 1993

    Google Scholar 

  37. D. Maier and D. S. Warren. Computing with logic. Logic programming with Prolog. The Benjamin/Cummings Publishing Company, Inc., 1988

    MATH  Google Scholar 

  38. I. Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. In Proceedings of the Workshop on Computational Aspects of Nonmonotonic Reasoning, pages 72–79, 1998

    Google Scholar 

  39. I. Niemelä and P. Simons. Evaluating an algorithm for default reasoning. In Proceedings of the IJCAI-95 Workshop on Applications and Implementations of Nonmonotonic Reasoning Systems, 1995

    Google Scholar 

  40. I. Niemelä and P. Simons. Efficient implementation of the well-founded and stable model semantics. In Proceedings of JICSLP-96. MIT Press, 1996

    Google Scholar 

  41. T. Przymusiński. On the declarative semantics of deductive databases and logic programs. In Foundations of deductive databases and logic programming, pages 193–216, Los Altos, CA, 1988. Morgan Kaufmann

    Google Scholar 

  42. T. Przymusiński. The Well-Founded Semantics Coincides With The Three-Valued Stable Semantics, Fundamenta Informaticae, 13:445–464, 1990.

    MathSciNet  MATH  Google Scholar 

  43. R. Reiter. A logic for default reasoning. Artificial Intelligence, 13:81–132, 1980.

    Article  MathSciNet  MATH  Google Scholar 

  44. J.A. Robinson. Machine-oriented logic based on resolution principle. Journal of the ACM, 12:23–41, 1965.

    Article  MATH  Google Scholar 

  45. P. Rao, I.V. Ramskrishnan, K. Sagonas, T. Swift, D. S. Warren, and J. Freire. XSB: A system for efficiently computing well-founded semantics. In Proceedings of LPNMR ’97, pages 430–440, Lecture Notes in Computer Science, 1265, Springer-Verlag, 1997

    Google Scholar 

  46. J. Schlipf. The expressive powers of the logic programming semantics. Journal of the Computer Systems and Science, 51:64–86, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  47. B. Selman and H. A. Kautz. Planning as satisfiability. In Proceedings of the 10th European Conference on Artificial Intelligence, Vienna, Austria, 1992

    Google Scholar 

  48. B. Selman and H. Kautz. Domain-independent extensions to GSAT: Solving large structured satisfiability problems. In Proceedings of IJCAI-93, San Mateo, CA, Morgan Kaufmann, 1993

    Google Scholar 

  49. B. Selman, H.A. Kautz, and B. Cohen. Noise strategies for improving local search. In Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94), Seattle, USA, AAAI Press, 1994.

    Google Scholar 

  50. R.M. Smullyan. First-Order Logic. Springer-Verlag, 1968

    MATH  Google Scholar 

  51. J.D. Ullman. Principles of Database and Knowledge-Base Systems. Computer Science Press, Rockville, MD, 1988

    Google Scholar 

  52. A. Van Gelder, K.A. Ross, and J.S. Schlipf. Unfounded sets and well- founded semantics for general logic programs. Journal of the ACM, 38:620–650, 1991

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Victor W. Marek & Miroslaw Truszczyński

Authors
  1. Victor W. Marek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Miroslaw Truszczyński
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Stichting Mathematisch Centrum, Centrum voor Wiskunde en Informatica, Kruislaan 413, 1098, Amsterdam, SJ, The Netherlands

    Krzysztof R. Apt

  2. Department of Computer Science, University of Kentucky, 773 Anderson Hall, 40506-0046, Lexington, KY, USA

    Victor W. Marek  & Mirek Truszczynski  & 

  3. Computer Science Department, University at Stony Brook, Stony Brook, 11794-4400, NY, USA

    David S. Warren

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Marek, V.W., Truszczyński, M. (1999). Stable Models and an Alternative Logic Programming Paradigm. In: Apt, K.R., Marek, V.W., Truszczynski, M., Warren, D.S. (eds) The Logic Programming Paradigm. Artificial Intelligence. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60085-2_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-60085-2_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-64249-4

  • Online ISBN: 978-3-642-60085-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation