Declarative and computational properties of logic programs with aggregates

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 406-411

  Calimeri, Francesco ^a   Faber, Wolfgang ^a   Leone, Nicola ^a   Perri, Simona ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATE-FREE PROGRAMS; ANSWER SET; COMPLEXITY ANALYSIS; COMPUTATIONAL PROPERTIES; LOGIC PROGRAMS; NONMONOTONE AGGREGATES; POLYNOMIAL HIERARCHIES; WELL-FOUNDED MODELS;

ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; LOGIC PROGRAMMING;

AGGREGATES;

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

References (25)

1. C. Baral. Knowledge Representation, Reasoning and Declarative Problem Solving. CUP, 2002.
2. F. Calimeri, W. Faber, N. Leone, and G. Pfeifer. Pruning Operators for Answer Set Programming Systems. In NMR'2002, pp. 200-209, 2002.
3. T. Dell'Armi, W. Faber, G. Ielpa, N. Leone, and G. Pfeifer. Aggregate Functions in DLV. In ASP'03, pp. 274-288, Messina, Italy, 2003. Online at http://CEUR-WS.org/Vol-78/.
4. M. Denecker, N. Pelov, and M. Bruynooghe. Ultimate Well-Founded and Stable Model Semantics for Logic Programs with Aggregates. In ICLP-2001, pp. 212-226. 2001.
5. J. Dix and M. Osorio. On Well-Behaved Semantics Suitable for Aggregation. In ILPS '97, Port Jefferson, N.Y., 1997.
6. W. Faber, N. Leone, and G. Pfeifer. Recursive aggregates in disjunctive logic programs: Semantics and complexity. In JELIA 2004, pp. 200-212. 2004.
7. P. Ferraris. Answer Sets for Propositional Theories. http://www.cs. utexas.edu/users/otto/papers/proptheories.ps, 2004.
8. M. Gelfond and V. Lifschitz. Classical Negation in Logic Programs and Disjunctive Databases. NGC, 9:365-385, 1991.
9. M. Gelfond. Representing Knowledge in A-Prolog. In Computational Logic. Logic Programming and Beyond, LNCS 2408
10. D.B. Kemp and P.J. Stuckey. Semantics of Logic Programs with Aggregates. In ISLP'91, pp. 387-401. MIT Press, 1991.
11. C. Koch, N. Leone, and G. Pfeifer. Enhancing Disjunctive Logic Programming Systems by SAT Checkers. Artificial Intelligence, 15(1-2):177-212, 2003.
12. J. Lee. A Model-Theoretic Counterpart of Loop Formulas. http://www.cs.utexas.edu/users/appsmurf/papers/mtclf.pdf, 2004.
13. N. Leone, P. Rullo, and F. Scarcello. Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics and Computation. Information and Computation, 135(2):69-112, 1997. (Pubitemid 127452754)
14. V.W. Marek and M. Truszczyński. Computing Intersection of Autoepistemic Expansions. In LPNMR'91, pp. 37-50, 1991.
15. M. Osorio and B. Jayaraman. Aggregation and Negation-As-Failure. NGC, 17(3):255-284, 1999.
16. N. Pelov and M. Truszczyński. Semantics of disjunctive programs with monotone aggregates - an operator-based approach. In NMR 2004, pp. 327-334, 2004.
17. N. Pelov, M. Denecker, and M. Bruynooghe. Partial stable models for logic programs with aggregates. In LPNMR-7, LNCS 2923
18. N. Pelov. Semantics of Logic Programs with Aggregates. PhD thesis, Katholieke Universiteit Leuven, Leuven, Belgium, 2004.
19. G. Pfeifer. Improving the Model Generation/Checking Interplay to Enhance the Evaluation of Disjunctive Programs. In LPNMR-7, LNCS, pp. 220-233. 2004.
20. K. A. Ross and Y. Sagiv. Monotonic Aggregation in Deductive Databases. JCSS, 54(1):79-97, 1997. (Pubitemid 127437198)
21. J.S. Schlipf. The Expressive Powers of Logic Programming Semantics. JCSS, 51(1):64-86, 1995.
22. P. Simons, I. Niemelä, and T. Soininen. Extending and Implementing the Stable Model Semantics. Artificial Intelligence, 138:181-234, 2002.
23. A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math, 5:285-309, 1955.
24. A. Van Gelder, K.A. Ross, and J.S. Schlipf. The Well-Founded Semantics for General Logic Programs. JACM, 38(3):620-650, 1991.
25. Allen Van Gelder. The Well-Founded Semantics of Aggregation. In PODS'92, pp. 127-138. ACM Press, 1992.