On the existence of stable models of non-stratified logic programs

Theory and Practice of Logic Programming

Volumn 6, Issue 1-2, 2006, Pages 169-212

  Costantini, Stefania ^a  

^a UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

Answer set semantics; Canonical programs; Logic programs class

Indexed keywords

GRAPH THEORY; LOGIC PROGRAMMING; SEMANTICS;

ANSWER SET SEMANTICS; CANONICAL PROGRAMS; LOGIC PROGRAMS CLASS;

MATHEMATICAL MODELS;

EID: 31644446719     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068405002589     Document Type: Article

References (40)

1. APT, K. AND BEZEM, M. 1991. Acyclic programs. New Generation Computing 9 (3-4), 335-365
2. BALDUCCINI, M., BRIGNOLI, G., LANZARONE, G. A., MAGNI, F. AND PROVETTI, A. 2000. Experiments in answer sets planning. Proc. of the 2000 Mexican International Conference on Artificial Intelligence.
3. BALDUCCINI, M. AND GELFOND, M. 2003. Diagnostic reasoning with A-Prolog. Theory and Practice of Logic Programming 3(4-5), 425-461.
4. BRIGNOLI, G., COSTANTINI, S., D'ANTONA, O. AND PROVETTI, A. 1999. Characterizing and computing stable models of logic programs: the non-stratified case. In Proceedings of CIT99 Conference on Information Technology.
5. COSTANTINI, S. 1995. Contributions to the stable model semantics of logic programs with negation. Theoretical Computer Science 149(2), 231-255.
6. COSTANTINI, S., LANZARONE, G. A., AND MAGLIOCCO, G. 1996. Asserting lemmas in the stable model semantics. In Logic Programming: Proceedings of the 1996 Joint International Conference and Symposium, The MIT Press, Cambridge, MA, 438-452.
7. COSTANTINI, S. 2001. Comparing different graph representations of logic programs under the answer set semantics. Proceedings AAAI Spring Symposium "Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning", 21-26.
8. COSTANTINI, S., D'ANTONA, O. AND PROVETTI, A., 2002. On the equivalence and range of applicability of graph-based representations of logic programs. Information Processing Letters 84(2), 241-249.
9. COSTANTINI, S., INTRIGILA, B. AND PROVETTI, A. 2003. Coherence of updates in answer set programming. In Proc. of the IJCAI-2003 Workshop on Nonmonotonic Reasoning, Action and Change, NRAC03, 66-72.
10. COSTANTINI, S. AND PROVETTI, A., 2004. Normal forms for answer set programming. Theory and Practice of Logic Programming. (To appear.)
11. DIX, J. 1995. A classification theory of semantics of normal logic programs: I. Strong properties. Fundamenta Informaticae XXII(3), 227-255.
12. DIX, J. 1995. A Classification theory of semantics of normal logic programs: I. Weak properties. Fundamenta Informaticae XXII(3), 257-288.
13. DIMOPOULOS, Y., NEBEL, B. AND KOEHLER, J. 1997. Encoding planning problems in nonmonotonic logic programs. Proceedings of 1997 European Conference on Planning, 169-181.
14. DIMOPOULOS, Y. AND TORRES, A. 1996. Graph theoretical structures in logic programs and default theories. Theoretical Computer Science 170(1-2), 209-244.
15. ERDEM, E. AND LIFSCHITZ, V. 2003. Tight logic programs. Theory and Practice of Logic Programming 3(4-5), 499-518.
16. ERDOGAN, S. AND LIFSCHITZ, V. 2004. Definitions in answer set programming. Logic Programming and Nonmonotonic Reasoning: Proceedings of 7th International Conference, LPNMR 2004, LNAI 2923, Springer-Verlag, 114-126.
17. LIFSCHITZ, V. AND TURNER, H. 1994. Splitting a logic program. Proceedings of the Eleventh International Conference on Logic Programming, The MIT Press, Cambridge, MA, 23-37.
18. FABER W., LEONE N. AND PFEIFER G., 1999. Pushing goal Derivation in DLP computations. In Logic Programming and Nonmonotonic Reasoning: Proc. of 5th International Conference, LPNMR'99, LNAI 1730, Springer-Verlag, 117-191.
19. FAGES, F. 1994. Consistency of dark's completion and existence of stable models. Methods of Logic in Computer Science 2, 51-60.
20. FITTING, M. 1985. A Kreepke-Kleene semantics for logic programs, Journal of Logic Programming 2(4), 295-312.
21. GELFOND, M. AND LIFSCHITZ, V. 1988. The stable model semantics for logic programming. Proceedings of the Fifth Joint International Conference and Symposium. The MIT Press, Cambridge, MA, 1070-1080.
22. GELFOND, M. AND LIFSCHITZ, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365-385.
23. KONCZAK, K., SCHAUB, T. AND LINKE, T., 2003. Graphs and colorings for answer set programming: Abridged report. Answer Set Programming: Advances in Theory and Implementation, ASP03. Volume 78 of The CEUR Workshop Proceedings Series, 137-150. http://eur-ws.org/Vol-78/.
24. KONCZAK, K., SCHAUB, T. AND LINKE, T., 2003. Graphs and colorings for answer set programming with preferences: Preliminary report. Answer Set Programming: Advances in Theory and Implementation, ASP03. Volume 78 of The CEUR Workshop Proceedings Series, 43-56. http://eur-ws.org/Vol-78/.
25. LIBERATORE, P. 1999. Algorithms and experiments on finding minimal models. Technical Report 09-99, University of Rome "La Sapienza".
26. LIFSCHITZ, V. 1999. Answer set planning. Proceedings of the 1999 International Conference on Logic Programming (invited talk). MIT Press, Cambridge, MA, 23-37.
27. LINKE, T. 2001. Graph theoretical characterization and computation of answer sets. Proceedings of IJCAI 2001, 641-648.
28. LINKE, T. 2003. Using nested logic programs for answer set programming. Answer Set Programming: Advances in Theory and Implementation, ASP03. Volume 78 of The CEUR Workshop Proceedings Series, 181-194. http://eur-ws.org/Vol-78/.
29. LINKE, T. 2003. Suitable graphs for answer set programming. Answer Set Programming: Advances in Theory and Implementation, ASP03. Volume 78 of The CEUR Workshop Proceedings Series, 15-28. http://eur-ws.org/Vol-78/.
30. MAREK, W., AND TRUSZCZYŃSKI, M. 1999. Stable models and an alternative logic programming paradigm. The Logic Programming Paradigm: a 25-Year Perspective. Springer Verlag, 375-398.
31. NIEMELÄ, I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25(3,4), 241-273,
32. (An earlier version appeared in the Proceedings of the NM'98 workshop.)
33. PRZYMUSINSKA, H. AND PRZYMUSINSKI, T. C. 1990. Semantic issues in deductive databases and logic programs. In: R. B. Banerji (ed.) Formal Techniques in Artificial Intelligence, a Sourcebook, Elsevier, 321-367.
34. TURNER, H. 1994. Signed logic programs. Proceedings of the 1994 International Symposium on Logic Programming, 61-75.
35. VAN GELDER A., Ross K.A. AND SCHLIPF J., 1990. The well-founded semantics for general logic programs. Journal of the ACM 38(3), 620-650.
36. WEB LOCATION OF THE MOST KNOWN ASP SOLVERS. Cmodels: http://www.cs. utexas.edu/users/yuliya/
37. Aspps: http://www.cs.uky.edu/ai/aspps/
38. DLV: http://www.dbai.tuwien.ac.at/proj/dlv/
39. NoMoRe: http://www.cs.uni-potadam.de/~linke/nomore/
40. Smodels: http://www.tcs.hut.fi/Software/smodels/