Design and implementation of aggregate functions in the DLV system

Theory and Practice of Logic Programming

Volumn 8, Issue 5-6, 2008, Pages 545-580

  Faber, Wolfgang ^a   Pfeifer, Gerald ^a   Leone, Nicola ^a   Dell'Armi, Tina ^a   Ielpa, Giuseppe ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Aggregates; Answer set programming; Disjunctive logic programming; Implementation; Knowledge representation

Indexed keywords

AGGLOMERATION; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING; INFORMATION THEORY; KNOWLEDGE REPRESENTATION; LOGIC PROGRAMMING; NUCLEAR PROPULSION; PROBABILITY DENSITY FUNCTION; SEMANTICS;

AGGREGATE FUNCTIONS; ANSWER SET PROGRAMMING; COMPLEXITY CLASSES; DISJUNCTIVE LOGIC PROGRAMMING; DISJUNCTIVE LOGIC PROGRAMMINGS; EXTENDED LANGUAGES; FINITE STRUCTURES; IMPLEMENTATION;

AGGREGATES;

EID: 56749155525     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068408003323     Document Type: Article

References (48)

1. APT, K. R., BLAIR, H, A. AND WALKER, A. 1988. Towards a theory of declarative knowledge. In Foundations of Deductive Databases and Logic Programming, J. Minker, Ed. Morgan Kaufmann Publishers, Inc., Washington, DC, 89-148.
2. BARAL, C. 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge, UK.
3. BEN-ELIYAHU, R. AND DECHTER, R. 1994. Prepositional semantics for disjunctive logic programs. Annals of Mathematics and Artificial Intelligence 12, 53-87.
4. BUCCAFURRI, F., LEONE, N. AND RULLO, P. 2000. Enhancing disjunctive datalog by constraints. IEEE Transactions on Knowledge and Data Engineering 12, 5, 845-860.
5. CALIMERI, F., FABER, W., LEONE, N. AND PERRI, S. 2005. Declarative and computational properties of logic programs with aggregates. In Nineteenth International Joint Conference on Artificial Intelligence (IJCAI-05). 406-411.
6. CHIMENTI, D., GAMBOA, R., KRISHNAMURTHY, R., NAQVI, S. A., TSUR, S. AND ZANIOLO, C. 1990. The LDL system prototype. IEEE Transactions on Knowledge and Data Engineering 2, 1, 76-90.
7. DELL'ARMI, T., FABER, W., IELPA, G., LEONE, N. AND PFEIFER, G. 2003. Aggregate functions in DLV. In Proceedings ASP03 - Answer Set Programming: Advances in Theory and Implementation, M. de Vos and A. Provetti, Eds. Messina, Italy, 274-288. Online at http://CEUR-WS.org/Vol-78/.
8. DOWLING, W. F. AND GALLIER, J. H. 1984. Linear-time algorithms for testing the satisfability of prepositional horn formulae. Journal of Logic Programming 3, 267-284.
9. EITER, T., FABER, W., LEONE, N. AND PFEIFER, G. 2000. Declarative problem-solving using the DLV system. In Logic-Based Artificial Intelligence, J. Minker, Ed. Kluwer Academic Publishers, Norwell, MA, USA, 79-103.
10. EITER, T. AND GOTTLOB, G. 1995. On the computational cost of disjunctive logic programming: prepositional case. Annals of Mathematics and Artificial Intelligence 15, 3/4, 289-323.
11. EITER, T., GOTTLOB, G. AND MANNILA, H. 1997a. Disjunctive datalog. ACM Transactions on Database Systems 22, 3 (Sept.), 364-418.
12. EITER, T., GOTTLOB, G. AND VEITH, H. 1997b. Modular logic programming and generalized quantifiers. In Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-97), J. Dix, U. Furbach, and A. Nerode, Eds. Lecture Notes in Computer Science, vol. 1265. Springer, Berlin, Germany, 290-309.
13. 4 - a system for computing answer sets of logic programs. In Logic Programming and Nonmonotonic Reasoning - 8th International Conference, LPNMR'05, Diamante, Italy, September 2005, C. Baral, G. Greco, N. Leone, and G. Terracina, Eds. Lecture Notes in Computer Science, vol. 3662. Springer-Verlag, Berlin, Germany, 427-431.
14. FABER, W. 2002. Enhancing Efficiency and Expressiveness in Answer Set Programming Systems. Ph.D. thesis, Institut für Informationssysteme, Technische Universität Wien.
15. FABER, W. 2005. Unfounded sets for disjunctive logic programs with arbitrary aggregates. In Logic Programming and Nonmonotonic Reasoning - 8th International Conference, LPNMR'05, Diamante, Italy, September 2005, C. Baral, G. Greco, N. Leone, and G. Terracina, Eds. Lecture Notes in Computer Science, vol. 3662. Springer-Verlag, Berlin, Germany, 40-52.
16. FABER, W., LEONE, N., MATEIS, C. AND PFEIFER, G. 1999. Using database optimization techniques for nonmonotonic reasoning. In Proceedings of the 7th International Workshop on Deductive Databases and Logic Programming (DDLP'99), INAP Organizing Committee, Ed. Prolog Association of Japan, 135-139.
17. FABER, W., LEONE, N. AND PFEIFER, G. 1999. Pushing goal derivation in DLP computations. In Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'99), M. Gelfond, N. Leone, and G. Pfeifer, Eds. Lecture Notes in AI (LNAI), vol. 1730. Springer Verlag, El Paso, TX, 177-191.
18. FABER, W., LEONE, N. AND PFEIFER, G. 2001. Experimenting with heuristics for answer set programming. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI) 2001. Morgan Kaufmann Publishers, Seattle, WA, USA, 635-640.
19. FABER, W., LEONE, N. AND PFEIFER, G. 2004. Recursive aggregates in disjunctive logic programs: Semantics and complexity. In Proceedings of the 9th European Conference on Artificial Intelligence (JELIA 2004), J. J. Alferes and J. Leite, Eds. Lecture Notes in AI (LNAI), vol. 3229. Springer-Verlag, Berlin, Germany, 200-212.
20. FERRARIS, P. 2005. Answer sets for prepositional theories. In Logic Programming and Nonmonotonic Reasoning - 8th International Conference, LPNMR'05, Diamante, Italy, September 2005, C. Baral, G. Greco, N. Leone, and G. Terracina, Eds. Lecture Notes in Computer Science, vol. 3662. Springer-Verlag, Berlin, Germany, 119-131.
21. FERRARIS, P. AND LIFSCHITZ, V. 2005. Weight constraints as nested expressions. Theory and Practice of Logic Programming 5, 1/2, 45-74.
22. GEBSER, M., KAUFMANN, B., NEUMANN, A. AND SCHAUB, T. 2007. Conflict-driven answer set solving. In Twentieth International Joint Conference on Artificial Intelligence (IJCAI-07). Morgan Kaufmann Publishers, San Francisco, CA, USA, 386-392.
23. GEBSER, M., LIU, L., NAMASIVAYAM, G., NEUMANN, A., SCHAUB, T. AND TRUSZCZYŃ SKI, M. 2007. The first answer set programming system competition. 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-Verlag, Tempe, AZ, 3-17.
24. GELFOND, M. 2002. Representing knowledge in A-prolog. In Computational Logic. Logic Programming and Beyond, A. C. Kakas and F. Sadri, Eds. Lecture Notes in Computer Science, vol. 2408. Springer, Berlin, Germany, 413-451.
25. GELFOND, M. AND LIFSCHITZ, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365-385.
26. GOTTLOB, G., LEONE, N. AND VEITH, H. 1999. Succinctness as a source of expression complexity. Annals of Pure and Applied Logic 97, 1-3, 231-260.
27. HELLA, L., LIBKIN, L., NURMONEN, J. AND WONG, L. 2001. Logics with aggregate operators. Journal of the ACM 48, 4, 880-907.
28. KEMP, D. B. AND RAMAMOHANARAO, K. 1998. Efficient recursive aggregation and negation in deductive databases. IEEE Transactions on Knowledge and Data Engineering 10, 727-745.
29. LEONE, N., PERRI, S. AND SCARCELLO, F. 2001. Improving ASP instantiators by join-ordering methods. In Logic Programming and Nonmonotonic Reasoning - 6th International Conference, LPNMR'01, Vienna, Austria, T. Eiter, W. Faber, and M. Truszczyński, Eds. Lecture Notes in AI (LNAI), vol. 2173. Springer-Verlag, Berlin, Germany, 280-294.
30. LEONE, N., PFEIFER, G., FABER, W., EITER, T., GOTTLOB, G., PERRI, S. AND SCARCELLO, F. 2006. The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic 7, 3 (July), 499-562.
31. 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.
32. LIERLER, Y. 2005. Cmodels for tight disjunctive logic programs. In W(C)LP 19th Workshop on (Constraint) Logic Programming, Ulm, Germany. Ulmer Informatik-Berichte. Universität Ulm, Germany, 163-166.
33. LIU, L. AND TRUSZCZYŃSKI, M. 2005. Properties of programs with monotone and convex constraints. In Proceedings of the 20th National Conference on Artificial Intelligence (AAAI'05), M. M. Veloso and S. Kambhampati, Eds. The MIT Press, Cambridge, MA, USA, 701-706.
34. MAREK, V. W., NIEMELÄ, I. AND TRUSZCZYŃSKI, M. 2004. Logic programming with monotone cardinality atom. In Proceedings of the 7th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR-7), V. Lifschitz and I. Niemelä, Eds. Lecture Notes in AI(LNAI), vol. 2923. Springer, Berlin, Germany, 154-166.
35. MAREK, V. W. AND REMMEL, J. B. 2002. On logic programs with cardinality constraints. In Proceedings of the 9th International Workshop on Non-Monotonic Reasoning (NMR'2002), S. Ben-ferhat and E. Giunchiglia, Eds. Toulouse, France, 219-228.
36. MAREK, V. W. AND TRUSZCZYŃSKI, M. 1991. Autoepistemic logic. Journal of the ACM 38, 3, 588-619.
37. MINKER, J. 1982. On indefinite data bases and the closed world assumption. In Proceedings 6th Conference on Automated Deduction (CADE '82), D. W. Loveland, Ed. Lecture Notes in Computer Science, vol. 138. Springer, New York, 292-308.
38. MINOUX, M. 1988. LTUR: A simplified linear-time unit resolution algorithm for horn formulae and computer implementation. Information Processing Letters 29, 1-12.
39. NIEMELÄ, I., SIMONS, P. AND SOININEN, T. 1999. Stable model semantics of weight constraint rules. In Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'99), M. Gelfond, N. Leone, and G. Pfeifer, Eds. Lecture Notes in AI (LNAI), vol. 1730. Springer Verlag, El Paso, TX, 107-116.
40. PELOV, N. 2004. Semantics of Logic Programs with Aggregates. Ph.D. thesis, Katholieke Universiteit Leuven, Leuven, Belgium.
41. PELOV, N., DENECKER, M. AND BRUYNOOGHE, M. 2004. Partial stable models for logic programs with aggregates. In Proceedings of the 7th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR-7). Lecture Notes in AI (LNAI), vol. 2923. Springer, Berlin, Germany, 207-219.
42. PRZYMUSINSKI, T. C. 1988. On the declarative semantics of deductive databases and logic programs. In Foundations of Deductive Databases and Logic Programming, J. Minker, Ed. Morgan Kaufmann Publishers, San Francisco, CA, USA, 193-216.
43. ROSS, K. A. AND SAGIV, Y. 1997. Monotonic aggregation in deductive databases. Journal of Computer and System Sciences 54, 1 (February), 79-97.
44. SIMONS, P., NIEMELÄ, I. AND SOININEN, T. 2002. Extending and implementing the stable model semantics. Artificial Intelligence 138, 181-234.
45. SON, T. C. AND PONTELLI, E. 2007. A constructive semantic characterization of aggregates in ASP. Theory and Practice of Logic Programming 7, 355-375.
46. SON, T. C., PONTELLI, E. AND ELKABANI, I. 2005. On logic programming with aggregates. Technical Report NMSU-CS-2005-006, New Mexico State University.
47. SYRJÄNEN, T. 2002. Lparse 1.0 User's Manual. http://www.tcs.hut.fi/Software/smodels/lparse.ps.gz.
48. ULLMAN, J. D. 1989. Principles of Database and Knowledge Base Systems. Computer Science Press. New York, NY, USA.