Aggregate functions in disjunctive logic programming: Semantics, complexity, and implementation in DLV

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 847-852

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

^a UNIVERSITY OF CALABRIA   (Italy)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATE FUNCTION; COMPLEXITY CLASS; DISJUNCTIVE LOGIC PROGRAMMING; DLP SYSTEMS; FINITE STRUCTURES; REAL-WORLD;

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; KNOWLEDGE BASED SYSTEMS; LOGIC PROGRAMMING; SEMANTICS;

AGGREGATES;

EID: 84880846309     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. D. Chimcnti, R. Gamboa, R. Krishnamurthy, S. Naqvi, S. Tsur, and C. Zaniolo. The LDL System Prototype. IEEE TKDE, 2(1), 1990.
2. T. Dell'Armi, W. Faber, G. Ielpa, N. Leone, and G. Pfeifer. Semantics and Computation of Aggregate Functions in Disjunctive Logic Programming. Technical Report INFSYS RR-1843-03-07, TU Wien, April 2003.
3. M. Denecker, N. Pelov, and M. Bruynooghe. Well-Founded and Stable Model Semantics for Logic Programs with Aggregates. ICLP-2001, pp. 212-226. Springer, 2001.
4. M. Denecker, V. Marek, and M. Truszczynski. Ultimate Approximations in Monotonic Knowledge Representation Systems. KR-2002, pp. 177-188.
5. W. F. Dowling and J. H. Gallicr. Linear-time Algorithms for Testing the Satisfability of Propositional Horn Formulae. JLP, 3:267-284, 1984.
6. T. Eiter, W. Faber, N. Leone, and G. Pfeifer. Declarative Problem-Solving Using the DLV System. Logic-Based Artificial Intelligence, pp. 79-103. Kluwer, 2000.
7. W. Faber, N. Leone, C. Mateis, and G. Pfeifer. Using Database Optimization Techniques for Nonmonotonic Reasoning. DDLP '99, pp. 135-139.
8. W. Faber, N. Leone, and G. Pfeifer. Pushing Goal Derivation in DLP Computations. LPNMR'99, pp. 177-191. Springer.
9. M. Gelfond and V. Lifschitz. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 9:365-385, 1991.
10. M. Gelfond. Representing Knowledge in A-Prolog. Computational Logic. Logic Programming and Beyond, number 2408 in LNCS, pp. 413-451. Springer, 2002.
11. D. B. Kemp and K. Ramamohanarao. Efficient Recursive Aggregation and Negation in Deductive Databases. IEEE TKDE, 10:727-745, 1998. (Pubitemid 128751998)
12. N. Leone, S. Perri, and F. Scarcello. Improving ASP Instantiators by Join-Ordering Methods. LPNMR '01, LNAI 2173. Springer, September 2001.
13. V.W. Marek and J.B. Remmel. On Logic Programs with Cardinality Constraints. NMR '2002, pp. 219-228, April 2002.
14. V.W. Marek and M. Truszczynski. Autoepistemic Logic. JACM, 38(3):588-619, 1991.
15. N. Pelov. Non-monotone Semantics for Logic Programs with Aggregates, http://www.cs.kuleuven.ac.be/∼pelov/papers/nma.ps.gz.,October 2002.
16. K. A. Ross and Y. Sagiv. Monotonic Aggregation in Deductive Databases. Journal of Computer and System Sciences, 54(1):79-97, February 1997. (Pubitemid 127437198)
17. P. Simons, I. Niemela, and T. Soininen. Extending and Implementing the Stable Model Semantics. Artificial Intelligence, 138:181-234, June 2002.