Abstract
The addition of aggregates has been one of the most relevant enhancements to the language of answer set programming (ASP). They strengthen the modelling power of ASP in terms of natural and concise problem representations.
In this paper, we carry out an in-depth study of the computational complexity of the language. The analysis pays particular attention to the impact of syntactical restrictions on programs in the form of limited use of aggregates, disjunction, and negation. While the addition of aggregates does not affect the complexity of the full language with negation and disjunction, it turns out that their presence does increase the complexity of non-disjunctive ASP programs up to the second level of the polynomial hierarchy. Interestingly, under cautious reasoning nonmonotone aggregates are even harder than disjunction (\({\it \Pi}{^{p}_{2}}\)-complete vs co-NP-complete on positive programs). However, we show that there are large classes of aggregates the addition of which does not cause any complexity gap even for normal programs, including the fragment allowing for arbitrary monotone, arbitrary antimonotone, and stratified (i.e., non-recursive) nonmonotone aggregates. Moreover, we also prove that for positive programs with arbitrary monotone, stratified antimonotone, and stratified nonmonotone aggregates the complexity remains polynomial. This analysis provides some useful indications on the possibility to implement aggregates in existing reasoning engines.
Supported by M.I.U.R. within projects “Potenziamento e Applicazioni della Programmazione Logica Disgiuntiva” and “Sistemi basati sulla logica per la rappresentazione di conoscenza: estensioni e tecniche di ottimizzazione.”
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. NGC 9, 365–385 (1991)
Eiter, T., Gottlob, G., Mannila, H.: Disjunctive Datalog. ACM TODS 22(3), 364–418 (1997)
Gelfond, M.: Representing Knowledge in A-Prolog. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol. 2408, pp. 413–451. Springer, Heidelberg (2002)
Faber, W., Leone, N., Pfeifer, G.: Recursive aggregates in disjunctive logic programs: Semantics and complexity. In: Alferes, J.J., Leite, J.A. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, Springer, Heidelberg (2004)
Pelov, N., Denecker, M., Bruynooghe, M.: Partial stable models for logic programs with aggregates. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, Springer, Heidelberg (2003)
Pelov, N., Truszczyński, M.: Semantics of disjunctive programs with monotone aggregates - an operator-based approach. In: NMR 2004, pp. 327–334 (2004)
Marek, V.W., Niemelä, I., Truszczyński, M.: Logic Programming with Monotone Cardinality Atom. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, Springer, Heidelberg (2003)
Pelov, N., Denecker, M., Bruynooghe, M.: Well-founded and Stable Semantics of Logic Programs with Aggregates. Theory and Practice of Logic Programming, Accepted for publication (2007), available in CoRR as cs.LO/0509024
Son, T.C.: Pontelli, E.: A Constructive Semantic Characterization of Aggregates in ASP. Theory and Practice of Logic Programming, Accepted for publication (2007), available in CoRR as cs.AI/0601051
Ferraris, P.: Answer Sets for Propositional Theories. In: Baral, C., et al. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, Springer, Heidelberg (2005)
Eiter, T., et al.: A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer Set Programming. In: IJCAI 2005, Edinburgh, UK, pp. 90–96 (2005)
Eiter, T., et al.: Effective Integration of Declarative Rules with External Evaluations for Semantic Web Reasoning. In: Sure, Y., Domingue, J. (eds.) ESWC 2006. LNCS, vol. 4011, pp. 273–287. Springer, Heidelberg (2006)
Faber, W., Leone, N., Ricca, F.: Heuristics for Hard ASP Programs. In: Nineteenth International Joint Conference on Artificial Intelligence (IJCAI-05), pp. 1562–1563 (2005)
Lin, F., Zhao, Y.: ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers. In: AAAI-2002, Edmonton, Alberta, Canada, AAAI Press, Menlo Park (2002)
Lierler, Y., Maratea, M.: Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, Springer, Heidelberg (2003)
Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. In: CUP (2003)
Leone, N., et al.: The DLV System for Knowledge Representation and Reasoning. ACM TOCL 7(3), 499–562 (2006)
Ullman, J.D.: Principles of Database and Knowledge Base Systems. Computer Science Press, New York (1989)
Faber, W.: Decomposition of Nonmonotone Aggregates in Logic Programming. In: Proceedings of the 20th Workshop on Logic Programming (WLP 2006), Vienna, Austria, pp. 164–171 (2006)
Dantsin, E., et al.: Complexity and Expressive Power of Logic Programming. ACM Computing Surveys 33(3), 374–425 (2001)
Gottlob, G., Leone, N., Veith, H.: Succinctness as a Source of Expression Complexity. Annals of Pure and Applied Logic 97(1–3), 231–260 (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Faber, W., Leone, N. (2007). On the Complexity of Answer Set Programming with Aggregates. In: Baral, C., Brewka, G., Schlipf, J. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2007. Lecture Notes in Computer Science(), vol 4483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72200-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-72200-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72199-4
Online ISBN: 978-3-540-72200-7
eBook Packages: Computer ScienceComputer Science (R0)