Extending and implementing the stable model semantics

Artificial Intelligence

Volumn 138, Issue 1-2, 2002, Pages 181-234

  Simons, Patrik ^a   Niemelä, Ilkka ^b   Soininen, Timo ^b  

^a Neotide Oy   (Finland)

^b AALTO UNIVERSITY   (Finland)

Author keywords

Answer set programming; Logic programs; Optimization; Stable model semantics; Weight constraints

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; CONSTRAINT THEORY; EMBEDDED SYSTEMS; FUNCTIONS; GRAPH THEORY; LOGIC PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION;

ANSWER SET PROGRAMMING; LOGIC PROGRAMS; STABLE MODEL SEMANTICS; WEIGHT CONSTRAINTS;

SEMANTICS;

EID: 0010122418     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(02)00187-X     Document Type: Article

References (70)

1. Aiello L.C., Massacci F. Verifying security protocols as planning in logic programming. ACM Trans. Comput. Logic. 2:(4):2001;542-580.
2. Aura T., Bishop M., Sniegowski D. Analyzing single-server network inhibition. Proceedings of the IEEE Computer Security Foundations Workshop, Cambridge, UK. 2000;108-117 IEEE Computer Society Press.
3. Bell C., Nerode A., Ng R.T., Subrahmanian V.S. Mixed integer programming methods for computing nonmonotonic deductive databases. J. ACM. 41:(6):1994;1178-1215.
4. Ben-Eliyahu R., Dechter R. Default reasoning using classical logic. Artificial Intelligence. 84:1996;113-150.
5. Buccafurri F., Leone N., Rullo P. Strong and weak constraints in disjunctive datalog. Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning. Lecture Notes in Computer Science. 1265:1997;2-17 Springer, Berlin.
6. Cadoli M., Palopoli L., Schaerf A., Vasile D. NP-SPEC: An executable specification language for solving all problems in NP. Proceedings of the First International Workshop on Practical Aspects of Declarative Languages, San Antonio, TX. Lecture Notes in Computer Science. 1551:1999;16-30 Springer, Berlin.
7. Chen W., Warren D.S. Computation of stable models and its integration with logical query processing. IEEE Trans. Knowledge Data Engrg. 8:(5):1996;742-757.
8. Cholewiński P., Marek V.W., Mikitiuk A., Truszczyński M. Computing with default logic. Artificial Intelligence. 112:1999;105-146.
9. Crawford J.M., Auton L.D. Experimental results on the crossover point in random 3-SAT. Artificial Intelligence. 81:(1):1996;31-57.
10. Davis M., Logemann G., Loveland D. A machine program for theorem proving. Comm. ACM. 5:1962;394-397.
11. de Kleer J. An assumption-based TMS. Artificial Intelligence. 28:1986;127-162.
12. Dimopoulos Y. On computing logic programs. J. Automat. Reason. 17:1996;259-289.
13. Dimopoulos Y., Nebel B., Koehler J. Encoding planning problems in non-monotonic logic programs. Proceedings of the Fourth European Conference on Planning, Toulouse, France. Lecture Notes in Computer Science. 1348: 1997;169-181 Springer, Berlin.
14. Dowling W.F., Gallier J.H. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J. Logic Programming. 3:1984;267-284.
15. Doyle J. A truth maintenance system. Artificial Intelligence. 12:1979;231-272.
16. East D., Truszczyński M. DATALOG with constraints - An answer-set programming system. Proceedings AAAI-00, Austin, TX. 2000;163-168 MIT Press, Cambridge, MA.
17. Eiter T., Gottlob G. On the computational cost of disjunctive logic programming: Propositional case. Ann. Math. Artificial Intelligence. 15:1995;289-323.
18. Eiter T., Gottlob G., Mannila H. Disjunctive datalog. ACM Trans. Database Systems. 22:(3):1997;364-418.
19. Elkan C. A rational reconstruction of nonmonotonic truth maintenance systems. Artificial Intelligence. 43:1990;219-234.
20. Eshghi K. Computing stable models by using the ATMS. Proceedings AAAI-90, Boston, MA. 1990;272-277 MIT Press, Cambridge, MA.
21. Faber W., Leone N., Pfeifer G. Pushing goal derivation in DLP computations. Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning, El Paso, TX. Lecture Notes in Computer Science. 1730:1999;177-191 Springer, Berlin.
22. Faber W., Leone N., Pfeifer G. Optimizing the computation of heuristics for answer set programming systems. Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning, Vienna, Austria. Lecture Notes in Computer Science. 2173:2001;295-308 Springer, Berlin.
23. Freeman J.W. Improvements to propositional satisfiability search algorithms, Ph.D. Thesis. 1995;University of Pennsylvania.
24. Gelfond M., Lifschitz V. The stable model semantics for logic programming. Proceedings of the 5th International Conference on Logic Programming, Seattle, WA. 1988;1070-1080 MIT Press, Cambridge, MA.
25. Greco S. Dynamic programming in Datalog with aggregates. IEEE Trans. Knowledge Data Engrg. 11:(2):1999;265-283.
26. Heljanko K. Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe Petri nets. Fund. Inform. 37:(3):1999;247-268.
27. Hietalahti M., Massacci F., Niemelä I. DES: A challenge problem for nonmonotonic reasoning systems. Proceedings of the 8th International Workshop on Non-Monotonic Reasoning (cs.AI/0003073), Breckenridge, CO. 2000;. cs.AI/0003039.
28. D.E. Knuth, The Stanford GraphBase, 1993. Available at ftp://labrea.stanford.edu/.
29. Krentel M. The complexity of optimization problems. J. Comput. System Sci. 36:1988;490-509.
30. Leone N., et al. Dlv, release 2001-06-11. http://www.dbai.tuwien.ac.at/proj/dlv/. 2001. A Disjunctive Datalog System.
31. Leone N., Romeo M., Rullo P., Saccà D. Effective implementation of negation in database logic query languages. LOGIDATA+: Deductive Databases with Complex Objects. Lecture Notes in Computer Science. 701:1993;159-175 Springer, Berlin.
32. Leone N., Rullo L., Scarcello F. Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation. Inform. and Comput. 135:(2):1997;69-112.
33. Li C.M. A constraint-based approach to narrow search trees for satisfiability. Inform. Process. Lett. 71:1999;75-80.
34. Li C.M., Anbulagan. Look-ahead versus look-back for satisfiability problems. Proceedings of the Third International Conference on Principles and Practice of Constraint Programming, Linz, Austria. Lecture Notes in Computer Science. 1330:1997;341-355 Springer, Berlin.
35. Lifschitz V. On the declarative semantics of logic programs with negation. Minker J. Foundations of Deductive Databases and Logic Programming. 1988;177-192 Morgan Kaufmann, Los Altos, CA.
36. Lifschitz V. Answer set planning. Proceedings of the 16th International Conference on Logic Programming, Las Cruces, NM. 1999;25-37 MIT Press, Cambridge, MA.
37. Lifschitz V., Woo T.Y.C. Answer sets in general nonmonotonic reasoning (preliminary report). Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, MA. 1992;603-614 Morgan Kaufmann, Los Altos, CA.
38. Liu X., Ramakrishnan C.R., Smolka S.A. Fully local and efficient evaluation of alternating fixed points. Proceedings of the 4th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Lisbon, Portugal. Lecture Notes in Computer Science. 1384:1998;5-19 Springer, Berlin.
39. Marek V.W., Subrahmanian V.S. The relationship between stable, supported, default and autoepistemic semantics for general logic programs. Theoret. Comput. Sci. 103:(2):1992;365-386.
40. Marek V.W., Truszczyński M. Stable models and an alternative logic programming paradigm. Apt K.R., Marek V.W., Truszczyński M., Warren D.S. The Logic Programming Paradigm: A 25-Year Perspective. 1999;375-398 Springer, Berlin. cs.LO/9809032.
41. McCarthy J. Circumscription - A form of non-monotonic reasoning. Artificial Intelligence. 13:1980;27-39.
42. McCarthy J. Applications of circumscription to formalizing commonsense knowledge. Artificial Intelligence. 28:1986;89-116.
43. Moore R.C. Semantical considerations on nonmonotonic logic. Artificial Intelligence. 25:1985;75-94.
44. Niemelä I. Logic programming with stable model semantics as a constraint programming paradigm. Ann. Math. Artificial Intelligence. 25:(3-4):1999;241-273.
45. Niemelä I., Simons P. Extending the Smodels system with cardinality and weight constraints. Minker J. Logic-Based Artificial Intelligence. 2000;491-521 Kluwer Academic, Dordrecht. Chapter 21.
46. Niemelä I., Simons P., Soininen T. Stable model semantics of weight constraint rules. Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning, El Paso, TX. Lecture Notes in Computer Science. 1730:1999;317-331 Springer, Berlin.
47. Papadimitriou C.H. Computational Complexity. 1995;Addison-Wesley, Reading, MA.
48. Pimentel S.G., Rodi W.L. A nonmonotonic assumption-based TMS using stable bases. Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, MA. 1991;485-495 Morgan Kaufmann, Los Altos, CA.
49. Przymusinski T. Stable semantics for disjunctive programs. New Generation Computing. 9:(3-4):1991;401-424.
50. Reiter R. A logic for default reasoning. Artificial Intelligence. 13:1980;81-132.
51. Rintanen J. Lexicographic priorities in default logic. Artificial Intelligence. 106:1998;221-265.
52. Sakama C., Inoue K. An alternative approach to the semantics of disjunctive logic programs and deductive databases. J. Automat. Reason. 13:1994;145-172.
53. Sakama C., Inoue K. Representing priorities in logic programs. Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming, Bonn, Germany. 1996;82-96.
54. B. Selman, Random k-SAT generator, 1994. Available at ftp://ftp.research.att.com/dist/ai/makewff.sh.Z.
55. Simons P. Extending the stable model semantics with more expressive rules. Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning, El Paso, TX. Lecture Notes in Computer Science. 1730:1999;305-316 Springer, Berlin.
56. Simons P. Extending and implementing the stable model semantics, Doctoral Dissertation, Research Report A58. 2000;Helsinki University of Technology, Helsinki, Finland.
57. Simons P. Smodels 2.26. http://www.tcs.hut.fi/Software/smodels/. 2000. A system for computing the stable models of logic programs.
58. Soininen T., Gelle E., Niemelä I. A fixpoint definition of dynamic constraint satisfaction. Jaffar J. Proceedings of the Fifth International Conference on Principles and Practice of Constraint Programming, Alexandria, VA. Lecture Notes in Computer Science. 1713:1999;419-433 Springer, Berlin.
59. Soininen T., Niemelä I. Developing a declarative rule language for applications in product configuration. Proceedings of the First International Workshop on Practical Aspects of Declarative Languages, San Antonio, TX. Lecture Notes in Computer Science. 1551:1999;305-319 Springer, Berlin.
60. Soininen T., Niemelä I., Tiihonen J., Sulonen R. Representing configuration knowledge with weight constraint rules. Proceedings of the AAAI Spring 2001 Symposium on Answer Set Programming, Stanford, CA. 2001;195-201 AAAI Press.
61. Subrahmanian V.S., Nau D., Vago C. WFS + branch and bound = stable models. IEEE Trans. Knowledge Data Engrg. 7:(3):1995;362-377.
62. Syrjänen T. Including diagnostic information in configuration models. Lloyd J.W., et al. Proceedings of the First International Conference on Computational Logic, Automated Deduction: Putting Theory into Practice, London, UK. Lecture Notes in Computer Science. 1861:2000;837-851 Springer, Berlin.
63. Syrjänen T. Lparse, a procedure for grounding domain-restricted logic programs. http://www.tcs.hut.fi/Software/smodels/lparse/. 2001.
64. Syrjänen T. Omega-restricted programs. Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning, Vienna, Austria. Lecture Notes in Computer Science. 2173:2001;267-279 Springer, Berlin.
65. Truszczynski M., et al. DeReS, a default reasoning system. http://www.cs.engr.uky.edu/ai/deres.html. 1999.
66. Van Gelder A., Ross K.A., Schlipf J.S. The well-founded semantics for general logic programs. J. ACM. 38:(3):1991;620-650.
67. Warren D.S., et al. The XSB programming system. http://www.cs.sunysb.edu/~sbprolog/xsb-page.html. 2000.
68. Zabih R., McAllester D. A rearrangement search strategy for determining propositional satisfiability. Proc. AAAI-88, St. Paul, MN. 1988;155-160 Morgan Kaufmann, Los Altos, CA.
69. ++, a second-generation deductive database system. http://www.cs.ucla.edu/ldl/. 1999.
70. Zhang H. SATO: An efficient propositional prover. Proceedings of the 14th International Conference on Automated Deduction, Townsville, North Queensland, Australia. 1997;272-275 Springer, Berlin.