On the equivalence and range of applicability of graph-based representations of logic programs

Information Processing Letters

Volumn 84, Issue 5, 2002, Pages 241-249

  Costantini, Stefania ^a   D'Antona, Ottavio ^b   Provetti, Alessandro ^c  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b UNIVERSITY OF MILAN   (Italy)

^c UNIVERSITY OF MESSINA   (Italy)

Author keywords

Answer Set Programming; Graph algorithms; Logic Programming

Indexed keywords

ALGORITHMS; GRAPH THEORY; SEMANTICS; THEOREM PROVING;

ANSWER SET PROGRAMMING; LOGIC PROGRAMS;

LOGIC PROGRAMMING;

EID: 0037121493     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00290-9     Document Type: Article

References (22)

1. Bertoni A., Grossi G., Provetti A., Kreinovich V., Tari L. The prospect for answer set computation by a genetic model. AAAI Spring Symposium ASP 2001. 2001;1-5 AAAI Press.
2. Brass S., Dix J., Freitag B., Zukowski U. Transformation-based bottom-up computation of the well-founded model. Theory and Practice of Logic Programming. 2001.
3. Brignoli G., Costantini S., D'Antona O., Provetti A. Characterizing and computing stable models of logic programs: the non-stratified case. Proc. 1999 Conference on Information Technology. 1999;197-201.
4. Cholewiński P., Truszczynśki M. Extremal problems in logic programming and stable model computation. Proc. IJC-SLP'96. 1996;408-422. Also in J. Logic Programming. 38:1999;219-242.
5. Cholewiński P., Truszczynśki M. Extremal problems in logic programming and stable model computation. Proc. IJC-SLP'96. 1996;408-422. Also in J. Logic Programming. 38:1999;219-242.
6. Costantini S. Contribution to the stable model semantics of logic programs with negation. Theoret. Comput. Sci. 149:1995;231-255.
7. Costantini S. On the existence of stable models of non-stratified logic programs. AAAI Spring 2001 Symposium ASP 2001. 2001;21-26 AAAI Press.
8. Costantini S., On the existence of stable models of non-stratified logic programs, Submitted for publication, 2002.
9. S. Costantini, A. Provetti, Normal forms for answer set programming, Submitted for publication, 2002.
10. Dimopoulos Y., Torres A. Graph theoretical structures in logic programs and default theories. Theoret. Comput. Sci. 170:1996;209-244.
11. Gelfond M., Lifschitz V. The stable model semantics for logic programming. Proc. 5th ILPS Conference. 1988;1070-1080.
12. Gelfond M., Lifschitz V. Classical negation in logic programs and disjunctive databases. New Generation Computing. 9:1991;365-386.
13. Heljanko K., Niemela I. Bounded LTL model checking with stable models. Proc. LPNMR01. Lecture Notes in Artificial Intelligence. 2173:2001;200-212 Springer.
14. Lifschitz V. Answer set planning. Invited talk Proc. ICLP'99 Conference. 1999;23-37 MIT Press, Cambridge, MA.
15. Linke T. Graph theoretical characterization and computation of answer sets. Proc. IJCAI-2001, Seattle, WA. 2001;641-648.
16. Marek W., Truszczyński M. Stable models and an alternative logic programming paradigm. The Logic Programming Paradigm: a 25-Year Perspective. 1999;375-398 Springer, Berlin.
17. Marek V., Remmel J. On the expressibility of stable Logic Programming. AAAI Spring 2001 Symposium ASP 2001. 2001;124-131 AAAI Press.
18. Provetti A., Tari L. Answer sets computation by genetic algorithms, preliminary report. Proc. of Genetic and Evolutionary Computation GECCO 2000 "Late breaking papers" track. 2000;303-308.
19. Provetti A.,Cao S. Tran, Answer Set Programming: toward Efficient and Scalable Knowledge Representation and Reasoning, AAAI Spring Symposium. 2001;AAAI Press.
20. Schlipf J. The expressive powers of the logic programming semantics. J. Comput. Systems Sci. 51:1995;64-86.
21. Web location of the most known ASP solvers; CCALC: http://www.cs.utexas.edu/users/mcain/cc; DeReS: http://www.cs.engr.uky.edu/~lpnmr/DeReS.html; DLV: http://www.dbai.tuwien.ac.at/proj/dlv/; NoMoRe: http://www.cs.uni-potsdam.de/~linke/nomore/; SMODELS: http://www.tcs.hut.fi/Software/smodels/.
22. Van Gelder A., Ross K.A., Schlipf J. The well-founded semantics for general logic programs. J. ACM. 38:(3):1990;620-650.