Magic sets for the bottom-up evaluation of finitely recursive programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5753 LNAI, Issue , 2009, Pages 71-86

  Calimeri, Francesco ^a   Cozza, Susanna ^a   Ianni, Giovambattista ^a   Leone, Nicola ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET PROGRAMMING; ANSWER SET SEMANTICS; COMPUTATIONAL MODEL; EVALUATION STRATEGIES; FUNCTION SYMBOLS; INFINITE DOMAINS; INPUT PROGRAMS; MAGIC SETS; QUERY EQUIVALENCE; QUERY EVALUATION; RECURSIVE PROGRAMS; RESEARCH COMMUNITIES; TOPDOWN;

COMPUTATIONAL LINGUISTICS; COMPUTER SOFTWARE SELECTION AND EVALUATION; LOGIC PROGRAMMING; RECURSIVE FUNCTIONS;

COMPUTABILITY AND DECIDABILITY;

EID: 70349873534     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04238-6_9     Document Type: Conference Paper

References (29)

1. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. CUP (2003)
2. Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programming. In: ICLP/SLP 1988, pp. 1070-1080. MIT Press, Cambridge (1988)
3. Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. NGC 9, 365-385 (1991)
4. Lifschitz, V.: Answer Set Planning. In: ICLP 1999, pp. 23-37 (1999)
5. Marek, V.W., Truszczýnski, M.: Stable Models and an Alternative Logic Programming Paradigm. In: The Logic Programming Paradigm - A 25-Year Perspective, pp. 375-398 (1999)
6. Syrjänen, T.: Omega-restricted logic programs. In: Eiter, T., Faber, W., Truszczýnski, M. (eds.) LPNMR 2001. LNCS (LNAI), vol.2173, p. 267. Springer, Heidelberg (2001)
7. Bonatti, P.A.: Reasoning with infinite stable models II: Disjunctive programs. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol.2401, pp. 333-346. Springer, Heidelberg (2002)
8. Bonatti, P.A.: Reasoning with infinite stable models. AI 156(1), 75-111 (2004)
9. Simkus, M., Eiter, T.: FDNC: Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol.4790, pp. 514-530. Springer, Heidelberg (2007)
10. Lin, F.,Wang, Y.: Answer Set Programming with Functions. In: KR 2008, Sydney, Australia, pp. 454-465. AAAI Press, Menlo Park (2008)
11. Cabalar, P.: Partial Functions and Equality in Answer Set Programming. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.5366, pp. 392-406. Springer, Heidelberg (2008)
12. Calimeri, F., Cozza, S., Ianni, G., Leone, N.: Computable Functions in ASP: Theory and Implementation. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.5366, pp. 407-424. Springer, Heidelberg (2008)
13. Baselice, S., Bonatti, P.A., Criscuolo, G.: On Finitely Recursive Programs. Tech. Report 0901.2850v1, arXiv.org (2009); To appear in TPLP (TPLP)
14. Bonatti, P.A.: Erratum to: Reasoning with infinite stable models. AI 172(15), 1833-1835 (2008)
15. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV System for Knowledge Representation and Reasoning. ACM TOCL 7(3), 499-562 (2006)
16. Calimeri, F., Cozza, S., Ianni, G., Leone, N.: DLV-Complex, homepage (since 2008), http://www.mat.unical.it/dlv-complex
17. Marano, M., Ianni, G., Ricca, F.: A Magic Set Implementation for Disjunctive Logic Programming with Function Symbols. Submitted to CILC 2009 (2009)
18. Bancilhon, F., Maier, D., Sagiv, Y., Ullman, J.D.: Magic Sets and Other Strange Ways to Implement Logic Programs. In: PODS 1986, Cambridge, Massachusetts, pp. 1-15 (1986)
19. Ullman, J.D.: Principles of Database and Knowledge Base Systems, vol.2. Computer Science Press (1989)
20. Beeri, C., Ramakrishnan, R.: On the Power of Magic. In: PODS 1987, pp. 269-284. ACM, New York (1987)
21. Cumbo, C., Faber,W., Greco, G., Leone, N.: Enhancing the magic-set method for disjunctive datalog programs. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol.3132, pp. 371- 385. Springer, Heidelberg (2004)
22. Van Gelder, A., Ross, K.A., Schlipf, J.S.: The Well-Founded Semantics for General Logic Programs. J. ACM 38(3), 620-650 (1991)
23. Lifschitz, V., Turner, H.: Splitting a Logic Program. In: ICLP 1994, pp. 23-37. MIT Press, Cambridge (1994)
24. Naqvi, S., Tsur, S.: A logical language for data and knowledge bases. CS Press, NY (1989)
25. Schreye, D.D., Decorte, S.: Termination of Logic Programs: The Never-Ending Story. JLP 19/20, 199-260 (1994)
26. Bossi, A., Cocco, N., Fabris, M.: Norms on Terms and their use in Proving Universal Termination of a Logic Program. Theoretical Computer Science 124(2), 297-328 (1994)
27. Bruynooghe, M., Codish, M., Gallagher, J.P., Genaim, S., Vanhoof, W.: Termination analysis of logic programs through combination of type-based norms. ACM TOPLAS 29(2), 10 (2007)
28. Behrend, A.: Soft stratification for magic set based query evaluation in deductive databases. In: PODS 2003, San Diego, CA, USA, pp. 102-110 (2003)
29. Faber, W., Greco, G., Leone, N.: Magic Sets and their Application to Data Integration. JCSS 73(4), 584-609 (2007)