article

Logic programs with stable model semantics as a constraint programming paradigm

Author:

Ilkka NiemeläAuthors Info & Claims

Annals of Mathematics and Artificial Intelligence, Volume 25, Issue 3-4

Pages 241 - 273

https://doi.org/10.1023/A:1018930122475

Published: 10 February 1999 Publication History

Abstract

Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic programming based knowledge representation techniques to constraint programming and because implementation methods for the stable model semantics for ground (variableýfree) programs have advanced significantly in recent years. For a program with variables these methods need a grounding procedure for generating a variableýfree program. As a practical approach to handling the grounding problem a subclass of logic programs, domain restricted programs, is proposed. This subclass enables efficient grounding procedures and serves as a basis for integrating builtýin predicates and functions often needed in applications. It is shown that the novel paradigm embeds classical logical satisfiability and standard (finite domain) constraint satisfaction problems but seems to provide a more expressive framework from a knowledge representation point of view. The first steps towards a programming methodology for the new paradigm are taken by presenting solutions to standard constraint satisfaction problems, combinatorial graph problems and planning problems. An efficient implementation of the paradigm based on domain restricted programs has been developed. This is an extension of a previous implementation of the stable model semantics, the Smodels system, and is publicly available. It contains, e.g., builtýin integer arithmetic integrated to stable model computation. The implementation is described briefly and some test results illustrating the current level of performance are reported.

References

[1]

{1} K.R. Apt, H.A. Blair and A. Walker, Towards a theory of declarative knowledge, in: Foundations of Deductive Databases and Logic Programming , ed. J. Minker (Morgan Kaufmann, Los Altos, 1988) pp. 89-148.

[2]

{2} C. Bell, A. Nerode, R.T. Ng and V.S. Subrahmanian, Mixed integer programming methods for computing nonmonotonic deductive databases, Journal of the ACM 41(6) (1994) 1178-1215.

[3]

{3} A.L. Blum and M.L. Furst, Fast planning through planning graph analysis, Artificial Intelligence 90 (1997) 281-300.

[4]

{4} T. Bylander, Complexity results for planning, in: Proceedings of the 12th International Joint Conference on Artificial Intelligence , Sydney, Australia (Morgan Kaufmann, 1991) pp. 274-279.

[5]

{5} M. Cadoli and L. Palopoli, Circumscribing DATALOG: Expressive power and complexity, Theor. Comput. Sci. 1-2 (1998) 215-244.

[6]

{6} M. Cadoli, L. Palopoli, A. Schaerf and D. Vasile, NP-SPEC: An executable specification language for solving all problems in NP, in: Proceedings of the First International Workshop on Practical Aspects of Declarative Languages , San Antonio, TX, January 1999 (Springer, 1999) pp. 16-30.

[7]

{7} W. Chen and D.S. Warren, Computation of stable models and its integration with logical query processing, IEEE Trans. Knowledge Data Engrg. 8(5) (1996) 742-757.

Digital Library

[8]

{8} W. Chen and D.S. Warren, Tabled evaluation with delaying for general logic programs, Journal of the ACM 43(1) (1996) 20-74.

[9]

{9} P. Cholewinski, Towards programming in default logic, in: Proceedings of the 9th International Symposium on Methodologies for Intelligent Systems , Zakopane, Poland, June 1996 (Springer, 1996) pp. 223-232.

[10]

{10} P. Cholewinski, V.W. Marek, A. Mikitiuk and M. Truszczynski, Experimenting with nonmonotonic reasoning, in: Proceedings of the 12th International Conference on Logic Programming , Tokyo (June 1995) pp. 267-281.

[11]

{11} P. Cholewinski, V.W. Marek and M. Truszczynski, Default reasoning system DeReS, in: Proceedings of the 5th International Conference on Principles of Knowledge Representation and Reasoning , Cambridge, MA, November 1996 (Morgan Kaufmann, 1996) pp. 518-528.

[12]

{12} J.M. Crawford and L.D. Auton, Experimental results on the crossover point in random 3-SAT, Artificial Intelligence 81(1) (1996) 31-57.

[13]

{13} Y. Dimopoulos, B. Nebel and J. Koehler, Encoding planning problems in non-monotonic logic programs, in: Proceedings of the Fourth European Conference on Planning , Toulouse, France, September 1997 (Springer, 1997) pp. 169-181.

[14]

{14} W.F. Dowling and J.H. Gallier, Linear-time algorithms for testing the satisfiability of propositional Horn formulae, J. Logic Programming 3 (1984) 267-284.

[15]

{15} T. Eiter, N. Leone, C. Mateis, G. Pfeifer and F. Scarnello, The KR system dlv: Progress report, comparisons and benchmarks, in: Proceedings of the 6th International Conference on Principles of Knowledge Representation and Reasoning , Trento, Italy, June 1998 (Morgan Kaufmann, 1998) pp. 406-417.

[16]

{16} C. Elkan, A rational reconstruction of nonmonotonic truth maintenance systems, Artificial Intelligence 43 (1990) 219-234.

Digital Library

[17]

{17} M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in: Proceedings of the 5th International Conference on Logic Programming , Seattle, August 1988 (MIT Press, Cambridge, MA, 1988) pp. 1070-1080.

[18]

{18} M. Gelfond and V. Lifschitz, Logic programs with classical negation, in: Proceedings of the 7th International Conference on Logic Programming , Jerusalem, Israel, June 1990 (MIT Press, Cambridge, MA, 1990) pp. 579-597.

[19]

{19} M. Gelfond and V. Lifschitz, Representing actions and change by logic programs, J. Logic Programming 17 (1993) 301-322.

[20]

{20} K. Heljanko, Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe Petri nets, in: Proceedings of the 5th International Conference on Tools and Algorithms for the Construction and Analysis of Systems , Amsterdam, The Netherlands, March 1999 (Springer, 1999) pp. 240-254.

[21]

{21} J. Jaffar and J.-L. Lassez, Constraint logic programming, in: Conference Record of the 14th Annual ACM Symposium on Principles of Programming Languages , ed. M.J. O'Donnell, Munich, Germany, January 1987 (ACM Press, 1987) pp. 111-119.

[22]

{22} A.C. Kakas and C. Mourlas, ACLP: Flexible solutions to complex problems, in: Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning , Dagstuhl, Germany, July 1997 (Springer, Berlin, 1997) pp. 387-398.

[23]

{23} D.E. Knuth, The Stanford GraphBase, 1993. Available at ftp://labrea.stanford.edu/.

[24]

{24} X. Liu, C.R. Ramakrishnan and S.A. Smolka, Fully local and efficient evaluation of alternating fixed points, in: Proceedings of the 4th International Conference on Tools and Algorithms for the Construction and Analysis of Systems , ed. B. Steffen, Lisbon, Portugal, March/April 1998 (Springer, Berlin, 1998) pp. 5-19.

[25]

{25} W. Marek and M. Truszczynski, Autoepistemic logic, Journal of the ACM 38 (1991) 588-619.

[26]

{26} W. Marek and M. Truszczynski, Stable models and an alternative logic programming paradigm, in: The Logic Programming Paradigm: a 25-Year Perspective (Springer, 1999) pp. 375-398, to appear.

[27]

{27} R.C. Moore, Semantical considerations on nonmonotonic logic, Artificial Intelligence 25 (1985) 75-94.

Digital Library

[28]

{28} I. Niemelä, Towards efficient default reasoning, in: Proceedings of the 14th International Joint Conference on Artificial Intelligence , Montreal, Canada, August 1995 (Morgan Kaufmann, 1995) pp. 312-318.

[29]

{29} I. Niemelä and P. Simons, Efficient implementation of the well-founded and stable model semantics, in: Proceedings of the Joint International Conference and Symposium on Logic Programming , ed. M. Maher, Bonn, Germany, September 1996 (MIT Press, Cambridge, MA, 1996) pp. 289-303.

[30]

{30} I. Niemelä and P. Simons, Smodels - an implementation of the stable model and well-founded semantics for normal logic programs, in: Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning , Dagstuhl, Germany, July 1997 (Springer, Berlin, 1997) pp. 420-429.

Digital Library

[31]

{31} R. Reiter, A logic for default reasoning, Artificial Intelligence 13 (1980) 81-132.

Digital Library

[32]

{32} K. Sagonas, T. Swift and D.S. Warren, An abstract machine for computing the well-founded semantics, in: Proceedings of the Joint International Conference and Symposium on Logic Programming , ed. M. Maher, Bonn, Germany, September 1996 (MIT Press, Cambridge, MA, 1996) pp. 274-288.

[33]

{33} P. Simons, Towards constraint satisfaction through logic programs and the stable model semantics, Research report A47, Helsinki University of Technology, Helsinki, Finland (August 1997). Available at http://www.tcs.hut.fi/pub/reports/A47.ps.gz.

[34]

{34} V.S. Subrahmanian, D. Nau and C. Vago, WFS + branch and bound = stable models, IEEE Trans. Knowledge Data Engrg. 7(3) (1995) 362-377.

Digital Library

[35]

{35} T. Syrjänen, Implementation of local grounding for logic programs with stable model semantics, Technical report B18, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland (October 1998). Available at http://www.tcs.hut.fi/pub/reports/B18.ps.gz.

[36]

{36} M.H. van Emden and R.A. Kowalski, The semantics of predicate logic as a programming language, Journal of the ACM 23 (1976) 733-742.

[37]

{37} A. Van Gelder, K.A. Ross and J.S. Schlipf, The well-founded semantics for general logic programs, Journal of the ACM 38(3) (1991) 620-650.

Digital Library

[38]

{38} J.-H. You, R. Cartwright and M. Li, Iterative belief revision in extended logic programming, Theor. Comput. Sci. 170 (1996) 383-406.

Cited By

Apostolakis IDastani MSichman JAlechina NDignum V(2024)Abstraction in Non-Monotonic ReasoningProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3663266(2722-2724)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3663266
Yamada YBanbara MInoue KSchaub TUehara R(2024)Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical AnalysisWALCOM: Algorithms and Computation10.1007/978-981-97-0566-5_18(242-256)Online publication date: 18-Mar-2024
https://dl.acm.org/doi/10.1007/978-981-97-0566-5_18
Heuer JWernhard C(2024)Synthesizing Strongly Equivalent Logic Programs: Beth Definability for Answer Set Programs via Craig Interpolation in First-Order LogicAutomated Reasoning10.1007/978-3-031-63498-7_11(172-193)Online publication date: 3-Jul-2024
https://dl.acm.org/doi/10.1007/978-3-031-63498-7_11
Show More Cited By

Index Terms

Logic programs with stable model semantics as a constraint programming paradigm
1. Computing methodologies
  1. Artificial intelligence
    1. Knowledge representation and reasoning
      1. Logic programming and answer set programming
2. Theory of computation
  1. Logic
    1. Constraint and logic programming

Index terms have been assigned to the content through auto-classification.

Recommendations

Expressiveness of Logic Programs under the General Stable Model Semantics

Stable model semantics had been recently generalized to non-Herbrand structures by several works, which provides a unified framework and solid logical foundations for answer set programming. This article focuses on the expressiveness of normal and ...
Providing declarative semantics for HH extended constraint logic programs
PPDP '04: Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming

This paper is focused on a double extension of traditional Logic Programming which enhances it following two different approaches. On one hand, extending Horn logic to hereditary Harrop formulas HH), in order to improve the expressive power; on the ...
Stable semantics for disjunctive programs
Abstract
We introduce the stable model semantics fordisjunctive logic programs and deductive databases, which generalizes the stable model semantics, defined earlier for normal (i.e., non-disjunctive) programs. Depending on whether only total (2-valued) or ...

Comments

Information & Contributors

Information

Published In

cover image Annals of Mathematics and Artificial Intelligence

Annals of Mathematics and Artificial Intelligence Volume 25, Issue 3-4

1999

253 pages

ISSN:1012-2443

Issue’s Table of Contents

Copyright © Copyright © 1999 Kluwer Academic Publishers.

Publisher

Kluwer Academic Publishers

United States

Publication History

Published: 10 February 1999

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

278
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Apostolakis IDastani MSichman JAlechina NDignum V(2024)Abstraction in Non-Monotonic ReasoningProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3663266(2722-2724)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3663266
Yamada YBanbara MInoue KSchaub TUehara R(2024)Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical AnalysisWALCOM: Algorithms and Computation10.1007/978-981-97-0566-5_18(242-256)Online publication date: 18-Mar-2024
https://dl.acm.org/doi/10.1007/978-981-97-0566-5_18
Heuer JWernhard C(2024)Synthesizing Strongly Equivalent Logic Programs: Beth Definability for Answer Set Programs via Craig Interpolation in First-Order LogicAutomated Reasoning10.1007/978-3-031-63498-7_11(172-193)Online publication date: 3-Jul-2024
https://dl.acm.org/doi/10.1007/978-3-031-63498-7_11
Alviano MAmendola DReiners L(2024)Marketplace Logistics via Answer Set ProgrammingPractical Aspects of Declarative Languages10.1007/978-3-031-52038-9_4(54-63)Online publication date: 15-Jan-2024
https://dl.acm.org/doi/10.1007/978-3-031-52038-9_4
Odekerken DLehtonen TBorg AWallner JJärvisalo MMarquis PSon TKern-Isberner G(2023)Argumentative reasoning in ASPIC+ under incomplete informationProceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning10.24963/kr.2023/52(531-541)Online publication date: 2-Sep-2023
https://dl.acm.org/doi/10.24963/kr.2023/52
Fionda VIelo ARicca FMarquis PSon TKern-Isberner G(2023)Logic-based composition of business process modelsProceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning10.24963/kr.2023/27(272-281)Online publication date: 2-Sep-2023
https://dl.acm.org/doi/10.24963/kr.2023/27
Nadeem MKleinekathofer JDrechsler R(2023)Polynomial Formal Verification exploiting Constant CutwidthProceedings of the 34th International Workshop on Rapid System Prototyping10.1145/3625223.3649274(1-7)Online publication date: 21-Sep-2023
https://dl.acm.org/doi/10.1145/3625223.3649274
Pianpak PLi JSon T(2023)Load Balancing in Distributed Multi-Agent Path Finder (DMAPF)Engineering Multi-Agent Systems10.1007/978-3-031-48539-8_9(130-147)Online publication date: 29-May-2023
https://dl.acm.org/doi/10.1007/978-3-031-48539-8_9
Kuhlmann INiskanen AJärvisalo M(2023)Computing MUS-Based Inconsistency MeasuresLogics in Artificial Intelligence10.1007/978-3-031-43619-2_50(745-755)Online publication date: 20-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-43619-2_50
Yamada YBanbara MInoue KSchaub T(2023)Recongo: Bounded Combinatorial Reconfiguration with Answer Set ProgrammingLogics in Artificial Intelligence10.1007/978-3-031-43619-2_20(278-286)Online publication date: 20-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-43619-2_20
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents