On the complexity of answer set programming with aggregates

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

Volumn 4483 LNAI, Issue , 2007, Pages 97-109

  Faber, Wolfgang ^a   Leone, Nicola ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATES; CASE BASED REASONING; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; SET THEORY;

ANSWER SET PROGRAMMING (ASP); ARBITRARY MONOTONE; POLYNOMIAL HIERARCHY; STRATIFIED ANTIMONOTONE;

LOGIC PROGRAMMING;

EID: 38049006467     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72200-7_10     Document Type: Conference Paper

References (21)

1. Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. NGC 9 (1991) 365-385
2. Eiter, T., Gottlob, G., Mannila, H.: Disjunctive Datalog. ACM TODS 22(3) (1997) 364-418
3. Gelfond, M.: Representing Knowledge in A-Prolog. In: Computational Logic. Logic Programming and Beyond. LNCS 2408 (2002) 413-451
4. Faber, W., Leone, N., Pfeifer, G.: Recursive aggregates in disjunctive logic programs: Semantics and complexity. In: JELIA 2004. LNCS 3229
5. Pelov, N., Denecker, M., Bruynooghe, M.: Partial stable models for logic programs with aggregates. In: LPNMR-7. LNCS 2923
6. Pelov, N., Truszczyński, M.: Semantics of disjunctive programs with monotone aggregates an operator-based approach. In: NMR 2004. (2004) 327-334
7. Marek, V.W., Niemelä, I., Truszczyński, M.: Logic Programming with Monotone Cardinality Atom. In: LPNMR-7. LNCS 2923
8. Pelov, N., Denecker, M., Bruynooghe, M.: Well-founded and Stable Semantics of Logic Programs with Aggregates. Theory and Practice of Logic Programming (2007) Accepted for publication, available in CoRR as cs.LO/0509024.
9. Tran Cao Son, Pontelli, E.: A Constructive Semantic Characterization of Aggregates in ASP. Theory and Practice of Logic Programming (2007) Accepted for publication, available in CoRR as cs.AI/0601051.
10. Ferraris, P.: Answer Sets for Prepositional Theories. In: LPNMR'05. LNCS 3662
11. Eiter, T., Ianni, G., Schindlauer, R., Tompits, H.: A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer Set Programming. In: IJCAI 2005, Edinburgh, UK (2005) 90-96
12. Eiter, T., Ianni, G., Tompits, H., Schindlauer, R.: Effective Integration of Declarative Rules with External Evaluations for Semantic Web Reasoning. In: Proceedings of the 3rd European Semantic Web Conference (ESWC 2006). (2006) 273-287
13. Faber, W., Leone, N., Ricca, F.: Heuristics for Hard ASP Programs. In: Nineteenth International Joint Conference on Artificial Intelligence (UCAI-05). (2005) 1562-1563
14. Lin, F, Zhao, Y.: ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers. In: AAAI-2002, Edmonton, Alberta, Canada, AAAI Press / MIT Press (2002)
15. Lierler, Y., Maratea, M.: Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs. In: LPNMR-7. LNCS 2923
16. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. CUP (2003)
17. 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) (2006) 499-562
18. Ullman, J.D.: Principles of Database and Knowledge Base Systems. Computer Science Press (1989)
19. Faber, W.: Decomposition of Nonmonotone Aggregates in Logic Programming. In: Proceedings of the 20th Workshop on Logic Programming (WLP 2006), Vienna, Austria (2006) 164-171
20. Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and Expressive Power of Logic Programming. ACM Computing Surveys 33(3) (2001) 374-425
21. Gottlob, G., Leone, N., Veith, H.: Succinctness as a Source of Expression Complexity. Annals of Pure and Applied Logic 97(1-3) (1999) 231-260