Technical note: Normal forms for answer sets programming

Theory and Practice of Logic Programming

Volumn 5, Issue 6, 2005, Pages 747-760

  Costantini, Stefania ^a   Provetti, Alessandro ^b  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b UNIVERSITY OF MESSINA   (Italy)

Author keywords

Answer set programming; Normal forms; Program transformation

Indexed keywords

ANSWER SET PROGRAMMING; NORMAL FORMS; PROGRAM PROPERTIES; PROGRAM TRANSFORMATION;

GRAPHIC METHODS; LOGIC PROGRAMMING; SEMANTICS; SET THEORY; SYNTACTICS;

COMPUTER PROGRAMMING;

EID: 27744471957     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068404002339     Document Type: Article

References (16)

1. BERTONI A., GROSSI G., PROVETTI A., KREINOVICH V. AND TARI L. 2001. The Prospect for Answer Set Computation by a Genetic Model. Proceedings of the AAAI Spring 2001 Symposium ("ASP01")., Technical report SS-01-01, AAAI Press, pp. 1-5.
2. BRIGNOLI, G., COSTANTINI, S., D'ANTONA, O. AND PROVETTI, A. 1999. Characterizing and computing stable models of logic programs: the non-stratified case. Proceedings of CIT99 Conference on Information Technology.
3. COSTANTINI, S. 1995. Contributions to the stable model semantics of logic programs with negation. Theoretical Computer Science 149(2), 231-255.
4. COSTANTINI, S. 2004. Comparing different graph representations of logic programs under the answer set semantics. Submitted for publication. Proceedings of the AAAI Spring 2001 Symposium ("ASP01"), Technical report SS-01-01, AAAI Press, pp. 21-26. (Available at http://costantini.di.univaq.it/ pubbls_stefi.htm)
5. COSTANTINI, S. 2004. On the existence of stable models of non-stratified logic programs. Technical Report TRCS 026/2003, Dipartimento di Informatica, University of L'Aquila. Submitted for publication. (Available at http://costantini.di.univaq.it/pubbls_stefi.htm)
6. GELFOND, M. AND LIFSCHITZ, V. 1988. The stable model semantics for logic programming. Proceedings of the Fifth Joint International Conference and Symposium. MIT Press, pp. 1070-1080.
7. GELFOND, M. AND LIFSCHITZ, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365-385.
8. MAREK, W. AND REMMEL, J. 2001. On the foundations of answer set programming. Proceedings of the AAAI Spring 2001 Symposium ("ASP01"). Technical report SS-01-01, AAAI Press, pp. 124-131.
9. MAREK, W., AND TRUSZCZYŃSKI, M. 1999. Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: a 25-Year Perspective. Springer Verlag, pp. 375-398.
10. 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, (An earlier version appeared in the Proceedings of the NM'98 workshop.)
11. 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.
12. WEB LOCATION OF THE MOST KNOWN ASP SOLVERS. Cmodels: http://www.cs. utexas.edu/users/yuliya/
13. Aspps: http://www.cs.uky.edu/ai/aspps/
14. DLV: http://www.dbai.tuwien.ac.at/proj/dlv/
15. NoMoRe: http://www.cs.uni-potsdam.de/-linke/nomore/
16. Smodels: http://www.tcs.hut.fi/Software/smodels/