Disjunctive ASP with functions: Decidable queries and effective computation

Theory and Practice of Logic Programming

Volumn 10, Issue 4-6, 2010, Pages 497-512

  Alviano, Mario ^a   Faber, Wolfgang ^a   Leone, Nicola ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

answer set programming; decidability; disjunctive logic programs; magic sets

Indexed keywords

COMPUTATION THEORY; COMPUTER CIRCUITS; COMPUTER PROGRAMMING; LOGIC PROGRAMMING; SEMANTICS;

ANSWER SET PROGRAMMING; DISJUNCTIVE LOGIC PROGRAMS; MAGIC SET TECHNIQUE; MAGIC SETS; QUERY ANSWERING; QUERY EVALUATION; STABLE MODEL SEMANTICS; STRATIFIED NEGATION;

COMPUTABILITY AND DECIDABILITY;

EID: 77957241737     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068410000244     Document Type: Article

References (23)

1. ALVIANO, M., FABER, W., GRECO, G., and LEONE, N. 2009. Magic Sets for Disjunctive Datalog Programs. Technical Report 09/2009, Dipartimento di Matematica, Università della Calabria, Italy. http://www.wfaber.com/ research/papers/TRMAT092009pdf.
2. BARAL, C. 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press.
3. BASELICE, S., BONATTI, P. A., and CRISCUOLO, G. 2009. On finitely recursive programs. Theory and Practice of Logic Programming 9, 2, 213-238.
4. BEERI, C. and RAMAKRISHNAN, R. 1991. On the power of magic. Journal of Logic Programming 10, 1-4, 255-259.
5. BONATTI, P. A. 2002. Reasoning with infinite stable models II: Disjunctive programs. In Proceedings of the 18th International Conference on Logic Programming (ICLP 2002). Lecture Notes in Computer Science, vol. 2401. Springer, 333-346.
6. BONATTI, P. A. 2004. Reasoning with infinite stable models. Artificial Intelligence 156, 1, 75-111.
7. BRUYNOOGHE, M., CODISH, M., GALLAGHER, J. P., GENAIM, S., and VANHOOF, W. 2007. Termination analysis of logic programs through combination of type-based norms. ACM Transactions on Programming Languages and Systems (TOPLAS) 29, 10, 10. (Pubitemid 46623339)
8. CABALAR, P. 2008. Partial Functions and Equality in Answer Set Programming. In Proceedings of the 24th International Conference on Logic Programming (ICLP 2008). Lecture Notes in Computer Science, vol. 5366. Springer, Udine, Italy, 392-406.
9. CALIMERI, F., COZZA, S., IANNI, G., and LEONE, N. 2008a. Computable Functions in ASP: Theory and implementation. In Proceedings of the 24th International Conference on Logic Programming (ICLP 2008). Lecture Notes in Computer Science, vol. 5366. Springer, Udine, Italy, 407-424.
10. CALIMERI, F., COZZA, S., IANNI, G., and LEONE, N. 2008b. DLV-Complex homepage. http://www.mat.unical.it/dlv-complex.
11. CALIMERI, F., COZZA, S., IANNI, G., and LEONE, N. 2009. Magic sets for the bottomup evaluation of finitely recursive programs. In Logic Programming and Nonmonotonic Reasoning - 10th International Conference (LPNMR 2009), E. Erdem, F. Lin, and T. Schaub, Eds. Lecture Notes in Computer Science, vol. 5753. Springer, 71-86.
12. EITER, T. and SIMKUS, M. 2009. Bidirectional answer set programs with function symbols. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09), C. Boutilier, Ed. Springer, Pasadena, CA, 765-771.
13. GEBSER, M., SCHAUB, T., and THIELE, S. 2007. Gringo: A new grounder for answer set programming. In Logic Programming and Nonmonotonic Reasoning-9th International Conference, LPNMR'07, C. Baral, G. Brewka, and J. Schlipf, Eds. Lecture Notes in Computer Science, vol. 4483. Springer, Tempe, Arizona, 266-271.
14. GELFOND, M. and LIFSCHITZ, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365-385.
15. GRECO, S. 2003. Binding propagation techniques for the optimization of bound disjunctive queries. IEEE Transactions on Knowledge and Data Engineering 15, 2 (March/April), 368-385.
16. KEMP, D. B., SRIVASTAVA, D., and STUCKEY, P. J. 1995. Bottom-up evaluation and query optimization of well-founded models. Theoretical Computer Science 146, 145-184.
17. LEONE, N., RULLO, P., and SCARCELLO, F. 1997. Disjunctive stable models: Unfounded sets, fixpoint semantics and computation. Information and Computation 135, 2 (June), 69-112. (Pubitemid 127452754)
18. LIERLER, Y. and LIFSCHITZ, V. 2009. One more decidable class of finitely ground programs. In Proceedings of the 25th International Conference on Logic Programming (ICLP 2009). Lecture Notes in Computer Science, vol. 5649. Springer, Pasadena, CA, 489-493.
19. LIN, F. and WANG, Y. 2008. Answer set programming with functions. In Proceedings of Eleventh International Conference on Principles of Knowledge Representation and Reasoning (KR2008). AAAI Press, Sydney, Australia, 454-465.
20. SIMKUS, M. and EITER, T. 2007. FDNC: Decidable non-monotonic disjunctive logic programs with function symbols. In Proceedings of the 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR2007). Lecture Notes in Computer Science, vol. 4790. Springer, 514-530.
21. SYRJäNEN, T. 2001. Omega-restricted logic programs. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning. Springer, Vienna, Austria, 267-279. (Pubitemid 33347423)
22. TÄRNLUND, S.-Å. 1977. Horn clause computability. BIT Numerical Mathematics 17, 2 (June), 215-226.
23. ULLMAN, J. D. 1989. Principles of Database and Knowledge Base Systems. Computer Science Press.