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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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
K. Apt and H.A. Blair. Arithmetical classification of perfect models of stratified programs. Fundamenta Informaticae, 12:1â17, 1990
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
F. Afrati, S. Cosmodakis, and M. Yannakakis. On DATALOG vs. polynomial time. In Proceedings of PODSâ91, pages 13â25, 1991
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
S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley Publishing Company, 1995
H. Andreka and I. Nemeti. The generalized completeness of Horn predicate logic as a programming language. Acta Cybernetica, 4:3â10, 1978.
K.R. Apt and M.H. van Emden. Contributions to the theory of logic programming. Journal of the ACM, 29:841â862, 1982
N.Bidoit and C. Froidevaux. Negation by default and unstratifiable logic programs. Theoretical Computer Science, 78:85â112, 1991
H.A. Blair, W. Marek, and J. Schlipf. The expressiveness of locally stratified programs. Annals of Mathematics and Artificial Intelligence, 15:209â229, 1995
P. Cholewinski. Automated reasoning with Default Logic. PhD thesis, University of Kentucky, 1996. Ph.D. Thesis.
A. Colmerauer, H. Kanoui, R. Pasero, and P. Roussel. Un systĂšme de communication homme-machine en frangais. Technical report, University of Marseille, 1973.
C.-L. Chang and C.-T. Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, 1973
K.L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and data bases, pages 293â322. Plenum Press, 1978
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
P. CholewiĆski, W. Marek, A. Mikitiuk, and M. TruszczyĆski. Programming with default logic. Submitted for publication, 1998
P. CholewiĆski, W. Marek, and M. TruszczyĆski. Default reasoning system DeReS. In Proceedings of KR-96, pages 518â528. Morgan Kaufmann, 1996
M. Cadoli and L. Palipoli. Circumscribing datalog: expressive power and complexity. Theoretical Computer Science, 193:215â244, 1998
M. Cadoli, L. Palipoli, A. Schaerf, and D. Vasile. Np-spec: An executable specification language for solving all problems in np. Unpublished manuscript, 1998.
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
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
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
M.R. Garey and D.S. Johnson. Computers and intractability; a guide to the theory of NP-completeness. W.H. Freeman, 1979
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
J. Herbrand. Recherches sur la théorie de la démonstrations. PhD thesis, Paris, 1930
M. Kaminski. A note on stable semantics for logic programs. Artificial Intelligence Journal, 96:467â479, 1997.
R. Kowalski. Predicate logic as a programming language. In Proceedings of IFIP 74, pages 569â574, Amsterdam, 1974. North Holland
R. Kowalski. Logic for Problem Solving. North Holland, Amsterdam, 1979.
V. Lifschitz. Action languages, answer sets and planning. This volume.
J. Lloyd. Foundations of logic programming. Berlin: Springer-Verlag, 1984.
D. Loveland. Automated Theorem Proving: A Logical Basis. North Holland, 1978.
J.W. Lloyd and R.W. Topor. Making prolog more expressive. Journal of Logic Programming, l (3):225â240, 1984
W. Marek, A. Nerode, and J. B. Remmel. The stable models of predicate logic programs. Journal of Logic Programming, 21(3):129â154, 1994
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
W. Marek and M. TruszczyĆski. Autoepistemic logic. Journal of the ACM, 38:588â619, 1991
W. Marek and M. TruszczyĆski. Nonmonotonic Logic - Context- Dependent Reasoning. Series Artificial Intelligence, Springer-Verlag, 1993
D. Maier and D. S. Warren. Computing with logic. Logic programming with Prolog. The Benjamin/Cummings Publishing Company, Inc., 1988
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
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
I. NiemelÀ and P. Simons. Efficient implementation of the well-founded and stable model semantics. In Proceedings of JICSLP-96. MIT Press, 1996
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
T. PrzymusiĆski. The Well-Founded Semantics Coincides With The Three-Valued Stable Semantics, Fundamenta Informaticae, 13:445â464, 1990.
R. Reiter. A logic for default reasoning. Artificial Intelligence, 13:81â132, 1980.
J.A. Robinson. Machine-oriented logic based on resolution principle. Journal of the ACM, 12:23â41, 1965.
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
J. Schlipf. The expressive powers of the logic programming semantics. Journal of the Computer Systems and Science, 51:64â86, 1995.
B. Selman and H. A. Kautz. Planning as satisfiability. In Proceedings of the 10th European Conference on Artificial Intelligence, Vienna, Austria, 1992
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
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.
R.M. Smullyan. First-Order Logic. Springer-Verlag, 1968
J.D. Ullman. Principles of Database and Knowledge-Base Systems. Computer Science Press, Rockville, MD, 1988
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
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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