Semantics and complexity of recursive aggregates in answer set programming

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. Previous semantic definitions typically agree in the case of non-recursive ag...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Artificial intelligence Jg. 175; H. 1; S. 278 - 298
Hauptverfasser:	Faber, Wolfgang, Pfeifer, Gerald, Leone, Nicola
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 2011
Schlagworte:	Aggregates Answer set programming Complexity Computational complexity Indication Nonmonotonic reasoning Pictures Programming Proposals Recursive Semantics Transformations Aggregates Computational complexity Nonmonotonic reasoning Answer set programming
ISSN:	0004-3702, 1872-7921
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

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. Previous semantic definitions typically agree in the case of non-recursive aggregates, but the picture is less clear for aggregates involved in recursion. Some proposals explicitly avoid recursive aggregates, most others differ, and many of them do not satisfy desirable criteria, such as minimality or coincidence with answer sets in the aggregate-free case. In this paper we define a semantics for programs with arbitrary aggregates (including monotone, antimonotone, and nonmonotone aggregates) in the full ASP language allowing also for disjunction in the head (disjunctive logic programming — DLP). This semantics is a genuine generalization of the answer set semantics for DLP, it is defined by a natural variant of the Gelfond–Lifschitz transformation, and treats aggregate and non-aggregate literals in a uniform way. This novel transformation is interesting per se also in the aggregate-free case, since it is simpler than the original transformation and does not need to differentiate between positive and negative literals. We prove that our semantics guarantees the minimality (and therefore the incomparability) of answer sets, and we demonstrate that it coincides with the standard answer set semantics on aggregate-free programs. Moreover, 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 DLP language, it turns out that their presence does increase the complexity of normal (i.e., non-disjunctive) ASP programs up to the second level of the polynomial hierarchy. 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. The analysis provides some useful indications on the possibility to implement aggregates in existing reasoning engines.
AbstractList	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. Previous semantic definitions typically agree in the case of non-recursive aggregates, but the picture is less clear for aggregates involved in recursion. Some proposals explicitly avoid recursive aggregates, most others differ, and many of them do not satisfy desirable criteria, such as minimality or coincidence with answer sets in the aggregate-free case. In this paper we define a semantics for programs with arbitrary aggregates (including monotone, antimonotone, and nonmonotone aggregates) in the full ASP language allowing also for disjunction in the head (disjunctive logic programming - DLP). This semantics is a genuine generalization of the answer set semantics for DLP, it is defined by a natural variant of the Gelfond-Lifschitz transformation, and treats aggregate and non-aggregate literals in a uniform way. This novel transformation is interesting per se also in the aggregate-free case, since it is simpler than the original transformation and does not need to differentiate between positive and negative literals. We prove that our semantics guarantees the minimality (and therefore the incomparability) of answer sets, and we demonstrate that it coincides with the standard answer set semantics on aggregate-free programs. Moreover, 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 DLP language, it turns out that their presence does increase the complexity of normal (i.e., non-disjunctive) ASP programs up to the second level of the polynomial hierarchy. 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. The analysis provides some useful indications on the possibility to implement aggregates in existing reasoning engines. 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. Previous semantic definitions typically agree in the case of non-recursive aggregates, but the picture is less clear for aggregates involved in recursion. Some proposals explicitly avoid recursive aggregates, most others differ, and many of them do not satisfy desirable criteria, such as minimality or coincidence with answer sets in the aggregate-free case. In this paper we define a semantics for programs with arbitrary aggregates (including monotone, antimonotone, and nonmonotone aggregates) in the full ASP language allowing also for disjunction in the head (disjunctive logic programming — DLP). This semantics is a genuine generalization of the answer set semantics for DLP, it is defined by a natural variant of the Gelfond–Lifschitz transformation, and treats aggregate and non-aggregate literals in a uniform way. This novel transformation is interesting per se also in the aggregate-free case, since it is simpler than the original transformation and does not need to differentiate between positive and negative literals. We prove that our semantics guarantees the minimality (and therefore the incomparability) of answer sets, and we demonstrate that it coincides with the standard answer set semantics on aggregate-free programs. Moreover, 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 DLP language, it turns out that their presence does increase the complexity of normal (i.e., non-disjunctive) ASP programs up to the second level of the polynomial hierarchy. 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. The analysis provides some useful indications on the possibility to implement aggregates in existing reasoning engines.
Author	Pfeifer, Gerald Faber, Wolfgang Leone, Nicola
Author_xml	– sequence: 1 givenname: Wolfgang surname: Faber fullname: Faber, Wolfgang email: faber@mat.unical.it – sequence: 2 givenname: Gerald surname: Pfeifer fullname: Pfeifer, Gerald email: gerald@pfeifer.com – sequence: 3 givenname: Nicola surname: Leone fullname: Leone, Nicola email: leone@mat.unical.it
BookMark	eNqFkD1PwzAQhi1UJFrgHzBkY0qwHefDDEio4lOVGIDZcuxL5Cpxiu0W-u9xFSYGmE53et6707NAMztaQOiC4IxgUl6tM-mCsSGjOI4wyzCmR2hO6oqmFadkhuYYY5bmFaYnaOH9OrY552SOnl9hkDYY5RNpdaLGYdPDlwn7ZGwTB2rrvNlBIrvOQScD-MTYSPpPcImHkGzc2Dk5DMZ2Z-i4lb2H8596it7v796Wj-nq5eFpebtKFcMspJqXbStrIIXMC1bzBrTMa84Vr-PDhGJVNrqkZcFYA1Q3TV1x0HmrNPAI5vkpupz2xtsfW_BBDMYr6HtpYdx6URdFRUhJDySbSOVG7x20YuPMIN1eECwO5sRaTObEwZzATERzMXb9K6ZMkMGMNjhp-v_CN1MYooKdASe8MmAVaBN1BqFH8_eCb-vqj_I
CitedBy_id	crossref_primary_10_1017_S1471068422000126 crossref_primary_10_1016_j_artint_2018_03_005 crossref_primary_10_1017_S1471068420000022 crossref_primary_10_1017_S1471068422000047 crossref_primary_10_1017_S147106841900019X crossref_primary_10_1016_j_artint_2015_03_007 crossref_primary_10_1016_j_artint_2015_03_006 crossref_primary_10_1007_s10994_018_5708_2 crossref_primary_10_1016_j_artint_2018_10_007 crossref_primary_10_1093_logcom_exv060 crossref_primary_10_1007_s10472_013_9350_1 crossref_primary_10_1017_S147106841600020X crossref_primary_10_1093_logcom_exv061 crossref_primary_10_3233_IA_190020 crossref_primary_10_1016_j_artint_2010_11_003 crossref_primary_10_1093_logcom_exad035 crossref_primary_10_1007_s13218_018_0545_9 crossref_primary_10_1017_S1471068416000211 crossref_primary_10_1109_TCIAIG_2015_2509600 crossref_primary_10_1017_S147106841500023X crossref_primary_10_1007_s10115_015_0890_z crossref_primary_10_1017_S1471068420000393 crossref_primary_10_1017_S1471068418000169 crossref_primary_10_1017_S1471068419000115 crossref_primary_10_1017_S1471068412000233 crossref_primary_10_1016_j_artint_2016_01_003 crossref_primary_10_1017_S1471068417000217 crossref_primary_10_1016_j_artint_2019_04_004 crossref_primary_10_1016_j_artint_2024_104112 crossref_primary_10_1145_3552490_3552492 crossref_primary_10_1017_S1471068422000096 crossref_primary_10_1017_S1471068424000309 crossref_primary_10_1145_2499937_2499938 crossref_primary_10_1016_j_ijar_2019_12_003 crossref_primary_10_1017_S147106841800056X crossref_primary_10_1017_S1471068422000266 crossref_primary_10_1145_3385658_3385660 crossref_primary_10_1145_3495009 crossref_primary_10_1017_S1471068418000534 crossref_primary_10_1016_j_artint_2019_103165 crossref_primary_10_1017_S1471068421000090 crossref_primary_10_1016_j_artint_2020_103370 crossref_primary_10_1016_j_artint_2015_09_008 crossref_primary_10_1017_S1471068418000133 crossref_primary_10_1093_logcom_exad017 crossref_primary_10_1007_s13748_024_00342_z crossref_primary_10_1017_S1471068416000478 crossref_primary_10_1093_logcom_exad014 crossref_primary_10_1145_2480759_2480767 crossref_primary_10_1017_S1471068420000368 crossref_primary_10_1016_j_artint_2024_104109 crossref_primary_10_1017_S1471068415000228 crossref_primary_10_1016_j_artint_2022_103726 crossref_primary_10_1016_j_artint_2023_103902 crossref_primary_10_1016_j_cmpb_2023_107817 crossref_primary_10_1093_logcom_exae041 crossref_primary_10_1017_S1471068419000255 crossref_primary_10_1016_j_artint_2020_103402 crossref_primary_10_1017_S1471068420000332 crossref_primary_10_1017_S1471068422000278 crossref_primary_10_1017_S1471068423000388 crossref_primary_10_1016_j_artint_2014_05_001 crossref_primary_10_1017_S1471068419000450 crossref_primary_10_1017_S1471068418000261 crossref_primary_10_3233_IA_180119 crossref_primary_10_1016_j_ijar_2020_07_004 crossref_primary_10_1017_S1471068417000436 crossref_primary_10_1080_0952813X_2018_1456793 crossref_primary_10_1017_S1471068414000222 crossref_primary_10_1017_S1471068418000418 crossref_primary_10_1609_aimag_v37i3_2673 crossref_primary_10_1093_logcom_exac072 crossref_primary_10_1016_j_artint_2012_04_001 crossref_primary_10_1016_j_artint_2016_04_004
Cites_doi	10.1613/jair.2171 10.1006/jcss.1997.1453 10.1007/11762256_22 10.1016/S0168-0072(98)00057-8 10.1017/S1471068406002936 10.1145/322290.322293 10.1017/S1471068406002973 10.1016/0004-3702(85)90042-6 10.1145/1149114.1149117 10.1145/502807.502810 10.1016/S0004-3702(02)00187-X 10.1007/BF01536399 10.1016/0004-3702(80)90012-0 10.1016/0004-3702(86)90032-9 10.1016/j.artint.2004.04.004 10.1017/S1471068403001923 10.1145/1119439.1119440 10.1007/BF03037169 10.1145/261124.261126 10.1016/0004-3702(80)90014-4 10.1145/116825.116836 10.1016/0004-3702(80)90011-9 10.1023/A:1018978005636
ContentType	Journal Article
Copyright	2010 Elsevier B.V.
Copyright_xml	– notice: 2010 Elsevier B.V.
DBID	6I. AAFTH AAYXX CITATION 7SC 8FD F28 FR3 JQ2 L7M L~C L~D
DOI	10.1016/j.artint.2010.04.002
DatabaseName	ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Computer and Information Systems Abstracts Technology Research Database ANTE: Abstracts in New Technology & Engineering Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Computer and Information Systems Abstracts Professional
DatabaseTitleList	Technology Research Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1872-7921
EndPage	298
ExternalDocumentID	10_1016_j_artint_2010_04_002 S000437021000038X
GroupedDBID	--K --M --Z -~X .DC .~1 0R~ 1B1 1~. 1~5 23N 4.4 457 4G. 5GY 5VS 6I. 6J9 6TJ 7-5 71M 77K 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AAKPC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABFNM ABFRF ABJNI ABMAC ABVKL ABXDB ABYKQ ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACWUS ACZNC ADBBV ADEZE ADMUD AEBSH AECPX AEFWE AEKER AENEX AETEA AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 E3Z EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F0J F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ IHE IXB J1W JJJVA KOM KQ8 LG9 LY7 M41 MO0 MVM N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG RNS ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TAE TN5 TR2 TWZ UPT UQL VQA WH7 WUQ XFK XJE XJT XPP XSW ZMT ~02 ~G- 77I 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 8FD F28 FR3 JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c404t-d96ffa8e15a35489beda3899c98187120c6bd626544be2dbb879ed3fcde9a3833
ISICitedReferencesCount	148
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000285947700012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0004-3702
IngestDate	Sat Sep 27 19:28:44 EDT 2025 Sat Nov 29 06:08:06 EST 2025 Tue Nov 18 21:56:06 EST 2025 Fri Feb 23 02:31:59 EST 2024
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	Aggregates Computational complexity Nonmonotonic reasoning Answer set programming
Language	English
License	http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c404t-d96ffa8e15a35489beda3899c98187120c6bd626544be2dbb879ed3fcde9a3833
Notes	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
OpenAccessLink	https://dx.doi.org/10.1016/j.artint.2010.04.002
PQID	855711623
PQPubID	23500
PageCount	21
ParticipantIDs	proquest_miscellaneous_855711623 crossref_primary_10_1016_j_artint_2010_04_002 crossref_citationtrail_10_1016_j_artint_2010_04_002 elsevier_sciencedirect_doi_10_1016_j_artint_2010_04_002
PublicationCentury	2000
PublicationDate	2011 2011-01-00 20110101
PublicationDateYYYYMMDD	2011-01-01
PublicationDate_xml	– year: 2011 text: 2011
PublicationDecade	2010
PublicationTitle	Artificial intelligence
PublicationYear	2011
Publisher	Elsevier B.V
Publisher_xml	– name: Elsevier B.V
References	McCarthy (br0060) 1980; 13 Marek, Niemelä, Truszczyński (br0330) 2004; vol. 2923 Anger, Gebser, Linke, Neumann, Schaub (br0220) 2005; vol. 3835 Gottlob, Leone, Veith (br0460) 1999; 97 Lifschitz, Tang, Turner (br0530) 1999; 25 Ross, Sagiv (br0260) 1997; 54 Eiter, Gottlob, Veith (br0510) 1997; vol. 1265 Dell'Armi, Faber, Ielpa, Leone, Pfeifer (br0280) Gelfond (br0270) 2002; vol. 2408 Son, Pontelli (br0350) 2007; 7 Apt, Blair, Walker (br0410) 1988 McCarthy (br0590) 1990 N. Pelov, M. Truszczyński, Semantics of disjunctive programs with monotone aggregates — An operator-based approach, in: Proceedings of the 10th International Workshop on Non-Monotonic Reasoning (NMR 2004), Whistler, BC, Canada, 2004, pp. 327–334. Ferraris, Lifschitz (br0520) 2005; 5 Lee, Lifschitz, Palla (br0540) 2008 McCarthy, Hayes (br0040) 1969; vol. 4 Niemelä, Simons, Soininen (br0430) 1999; vol. 1730 Dantsin, Eiter, Gottlob, Voronkov (br0450) 2001; 33 Przymusinski (br0420) 1988 Kemp, Stuckey (br0250) 1991 McDermott (br0100) 1982; 29 Lierler, Maratea (br0200) 2004; vol. 2923 W. Faber, Decomposition of nonmonotone aggregates in logic programming, in: M. Fink, H. Tompits, S. Woltran (Eds.), Proceedings of the 20th Workshop on Logic Programming (WLP 2006), Vienna, Austria, 2006, pp. 164–171. T. Eiter, G. Ianni, H. Tompits, R. Schindlauer, Effective integration of declarative rules with external evaluations for semantic web reasoning, in: Proceedings of the 3rd European Semantic Web Conference (ESWC 2006), 2006, pp. 273–287. Moore (br0110) 1985; 25 V.W. Marek, J.B. Remmel, On logic programs with cardinality constraints, in: S. Benferhat, E. Giunchiglia (Eds.), Proceedings of the 9th International Workshop on Non-Monotonic Reasoning (NMR 2002), Toulouse, France, 2002, pp. 219–228. McDermott, Doyle (br0090) 1980; 13 Faber, Leone, Pfeifer (br0010) 2004; vol. 3229 N. Pelov, Semantics of logic programs with aggregates, Ph.D. thesis, Katholieke Universiteit Leuven, Leuven, Belgium, Apr. 2004. J. McCarthy, Programs with common sense, in: Proceedings of the Teddington Conference on the Mechanization of Thought Processes, Her Majesty's Stationery Office, 1959, pp. 75–91. T.C. Son, E. Pontelli, I. Elkabani, On logic programming with aggregates, Tech. Rep. NMSU-CS-2005-006, New Mexico State University, 2005. Stockmeyer, Meyer (br0470) 1973 Lin, Zhao (br0390) 2002 Son, Pontelli, Tu (br0580) 2007; 29 Minsky (br0050) 1975 Gebser, Kaufmann, Neumann, Schaub (br0230) 2007 Marek, Remmel (br0320) 2004; vol. 2923 Lin, Zhao (br0190) 2004; 157 T. Eiter, G. Ianni, R. Schindlauer, H. Tompits, A uniform integration of higher-order reasoning and external evaluations in answer set programming, in: International Joint Conference on Artificial Intelligence (IJCAI 2005), Edinburgh, UK, 2005, pp. 90–96. Eiter, Gottlob (br0490) 1995; 15 Baral (br0130) 2003 Pelov, Denecker, Bruynooghe (br0290) 2004; vol. 2923 Gelfond, Lifschitz (br0120) 1991; 9 Anger, Konczak, Linke (br0210) 2001; vol. 2173 Mumick, Pirahesh, Ramakrishnan (br0240) 1990 P. Ferraris, J. Lee, V. Lifschitz, A new perspective on stable models, in: Twentieth International Joint Conference on Artificial Intelligence (IJCAI-07), 2007, pp. 372–379. Eiter, Gottlob, Mannila (br0150) 1997; 22 Leone, Pfeifer, Faber, Eiter, Gottlob, Perri, Scarcello (br0180) 2006; 7 Minker (br0140) 1982; vol. 138 Ferraris (br0370) 2005; vol. 3662 Pelov, Denecker, Bruynooghe (br0340) 2007; 7 Simons, Niemelä, Soininen (br0160) 2002; 138 Ullman (br0400) 1989 Marek, Truszczyński (br0480) 1991; 38 Dell'Armi, Faber, Ielpa, Leone, Pfeifer (br0380) 2003 F. Calimeri, W. Faber, N. Leone, S. Perri, Declarative and computational properties of logic programs with aggregates, in: Nineteenth International Joint Conference on Artificial Intelligence (IJCAI-05), 2005, pp. 406–411. McCarthy (br0070) 1986; 28 Reiter (br0080) 1980; 13 Janhunen, Niemelä, Seipel, Simons, You (br0170) 2006; 7 10.1016/j.artint.2010.04.002_br0030 Son (10.1016/j.artint.2010.04.002_br0350) 2007; 7 Ferraris (10.1016/j.artint.2010.04.002_br0370) 2005; vol. 3662 10.1016/j.artint.2010.04.002_br0310 10.1016/j.artint.2010.04.002_br0550 Lin (10.1016/j.artint.2010.04.002_br0390) 2002 Dantsin (10.1016/j.artint.2010.04.002_br0450) 2001; 33 Gebser (10.1016/j.artint.2010.04.002_br0230) 2007 Minsky (10.1016/j.artint.2010.04.002_br0050) 1975 Lin (10.1016/j.artint.2010.04.002_br0190) 2004; 157 Ullman (10.1016/j.artint.2010.04.002_br0400) 1989 Leone (10.1016/j.artint.2010.04.002_br0180) 2006; 7 Ross (10.1016/j.artint.2010.04.002_br0260) 1997; 54 Pelov (10.1016/j.artint.2010.04.002_br0290) 2004; vol. 2923 10.1016/j.artint.2010.04.002_br0560 Ferraris (10.1016/j.artint.2010.04.002_br0520) 2005; 5 10.1016/j.artint.2010.04.002_br0360 Mumick (10.1016/j.artint.2010.04.002_br0240) 1990 Gelfond (10.1016/j.artint.2010.04.002_br0270) 2002; vol. 2408 McCarthy (10.1016/j.artint.2010.04.002_br0060) 1980; 13 Eiter (10.1016/j.artint.2010.04.002_br0150) 1997; 22 10.1016/j.artint.2010.04.002_br0440 Lee (10.1016/j.artint.2010.04.002_br0540) 2008 Son (10.1016/j.artint.2010.04.002_br0580) 2007; 29 McCarthy (10.1016/j.artint.2010.04.002_br0070) 1986; 28 Dell'Armi (10.1016/j.artint.2010.04.002_br0280) Niemelä (10.1016/j.artint.2010.04.002_br0430) 1999; vol. 1730 10.1016/j.artint.2010.04.002_br0570 Simons (10.1016/j.artint.2010.04.002_br0160) 2002; 138 Eiter (10.1016/j.artint.2010.04.002_br0490) 1995; 15 Eiter (10.1016/j.artint.2010.04.002_br0510) 1997; vol. 1265 Lierler (10.1016/j.artint.2010.04.002_br0200) 2004; vol. 2923 Marek (10.1016/j.artint.2010.04.002_br0330) 2004; vol. 2923 Reiter (10.1016/j.artint.2010.04.002_br0080) 1980; 13 Janhunen (10.1016/j.artint.2010.04.002_br0170) 2006; 7 Baral (10.1016/j.artint.2010.04.002_br0130) 2003 Faber (10.1016/j.artint.2010.04.002_br0010) 2004; vol. 3229 Moore (10.1016/j.artint.2010.04.002_br0110) 1985; 25 Stockmeyer (10.1016/j.artint.2010.04.002_br0470) 1973 McDermott (10.1016/j.artint.2010.04.002_br0100) 1982; 29 McCarthy (10.1016/j.artint.2010.04.002_br0590) 1990 10.1016/j.artint.2010.04.002_br0020 Marek (10.1016/j.artint.2010.04.002_br0320) 2004; vol. 2923 Dell'Armi (10.1016/j.artint.2010.04.002_br0380) 2003 Lifschitz (10.1016/j.artint.2010.04.002_br0530) 1999; 25 Pelov (10.1016/j.artint.2010.04.002_br0340) 2007; 7 Apt (10.1016/j.artint.2010.04.002_br0410) 1988 McCarthy (10.1016/j.artint.2010.04.002_br0040) 1969; vol. 4 Minker (10.1016/j.artint.2010.04.002_br0140) 1982; vol. 138 10.1016/j.artint.2010.04.002_br0500 Kemp (10.1016/j.artint.2010.04.002_br0250) 1991 Anger (10.1016/j.artint.2010.04.002_br0220) 2005; vol. 3835 10.1016/j.artint.2010.04.002_br0300 Anger (10.1016/j.artint.2010.04.002_br0210) 2001; vol. 2173 McDermott (10.1016/j.artint.2010.04.002_br0090) 1980; 13 Przymusinski (10.1016/j.artint.2010.04.002_br0420) 1988 Gottlob (10.1016/j.artint.2010.04.002_br0460) 1999; 97 Gelfond (10.1016/j.artint.2010.04.002_br0120) 1991; 9 Marek (10.1016/j.artint.2010.04.002_br0480) 1991; 38
References_xml	– volume: 7 start-page: 1 year: 2006 end-page: 37 ident: br0170 article-title: Unfolding partiality and disjunctions in stable model semantics publication-title: ACM Transactions on Computational Logic – volume: 13 start-page: 27 year: 1980 end-page: 39 ident: br0060 article-title: Circumscription — A form of non-monotonic reasoning publication-title: Artificial Intelligence – volume: 54 start-page: 79 year: 1997 end-page: 97 ident: br0260 article-title: Monotonic aggregation in deductive databases publication-title: Journal of Computer and System Sciences – volume: 7 start-page: 355 year: 2007 end-page: 375 ident: br0350 article-title: A constructive semantic characterization of aggregates in ASP publication-title: Theory and Practice of Logic Programming – year: 1990 ident: br0590 article-title: Formalization of Common Sense – reference: P. Ferraris, J. Lee, V. Lifschitz, A new perspective on stable models, in: Twentieth International Joint Conference on Artificial Intelligence (IJCAI-07), 2007, pp. 372–379. – reference: N. Pelov, M. Truszczyński, Semantics of disjunctive programs with monotone aggregates — An operator-based approach, in: Proceedings of the 10th International Workshop on Non-Monotonic Reasoning (NMR 2004), Whistler, BC, Canada, 2004, pp. 327–334. – volume: vol. 4 start-page: 463 year: 1969 end-page: 502 ident: br0040 article-title: Some philosophical problems from the standpoint of artificial intelligence publication-title: Machine Intelligence – volume: vol. 3229 start-page: 200 year: 2004 end-page: 212 ident: br0010 article-title: Recursive aggregates in disjunctive logic programs: Semantics and complexity publication-title: Proceedings of the 9th European Conference on Artificial Intelligence (JELIA 2004) – ident: br0280 article-title: Aggregate functions in DLV – volume: 15 start-page: 289 year: 1995 end-page: 323 ident: br0490 article-title: On the computational cost of disjunctive logic programming: Propositional case publication-title: Annals of Mathematics and Artificial Intelligence – start-page: 386 year: 2007 end-page: 392 ident: br0230 article-title: Conflict-driven answer set solving publication-title: Twentieth International Joint Conference on Artificial Intelligence (IJCAI-07) – start-page: 387 year: 1991 end-page: 401 ident: br0250 article-title: Semantics of logic programs with aggregates publication-title: Proceedings of the International Symposium on Logic Programming (ISLP '91) – volume: 7 start-page: 499 year: 2006 end-page: 562 ident: br0180 article-title: The DLV system for knowledge representation and reasoning publication-title: ACM Transactions on Computational Logic – volume: 97 start-page: 231 year: 1999 end-page: 260 ident: br0460 article-title: Succinctness as a source of expression complexity publication-title: Annals of Pure and Applied Logic – volume: 25 start-page: 75 year: 1985 end-page: 94 ident: br0110 article-title: Semantical considerations on nonmonotonic logic publication-title: Artificial Intelligence – volume: 25 start-page: 369 year: 1999 end-page: 389 ident: br0530 article-title: Nested expressions in logic programs publication-title: Annals of Mathematics and Artificial Intelligence – volume: vol. 138 start-page: 292 year: 1982 end-page: 308 ident: br0140 article-title: On indefinite data bases and the closed world assumption publication-title: Proceedings of the 6th Conference on Automated Deduction (CADE '82) – start-page: 1 year: 1973 end-page: 9 ident: br0470 article-title: Word problems requiring exponential time: Preliminary report publication-title: Conference Record of 5th Annual ACM Symposium on Theory of Computing (STOC '73) – volume: 33 start-page: 374 year: 2001 end-page: 425 ident: br0450 article-title: Complexity and expressive power of logic programming publication-title: ACM Computing Surveys – volume: vol. 2923 start-page: 207 year: 2004 end-page: 219 ident: br0290 article-title: Partial stable models for logic programs with aggregates publication-title: Proceedings of the 7th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR-7) – volume: 5 start-page: 45 year: 2005 end-page: 74 ident: br0520 article-title: Weight constraints as nested expressions publication-title: Theory and Practice of Logic Programming – volume: 13 start-page: 41 year: 1980 end-page: 72 ident: br0090 article-title: Non-monotonic logic I publication-title: Artificial Intelligence – reference: F. Calimeri, W. Faber, N. Leone, S. Perri, Declarative and computational properties of logic programs with aggregates, in: Nineteenth International Joint Conference on Artificial Intelligence (IJCAI-05), 2005, pp. 406–411. – start-page: 193 year: 1988 end-page: 216 ident: br0420 article-title: On the declarative semantics of deductive databases and logic programs publication-title: Foundations of Deductive Databases and Logic Programming – reference: J. McCarthy, Programs with common sense, in: Proceedings of the Teddington Conference on the Mechanization of Thought Processes, Her Majesty's Stationery Office, 1959, pp. 75–91. – volume: vol. 2923 start-page: 346 year: 2004 end-page: 350 ident: br0200 article-title: Cmodels-2: SAT-based answer set solver enhanced to non-tight programs publication-title: Proceedings of the 7th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR-7) – volume: 13 start-page: 81 year: 1980 end-page: 132 ident: br0080 article-title: A logic for default reasoning publication-title: Artificial Intelligence – volume: vol. 2923 start-page: 154 year: 2004 end-page: 166 ident: br0330 article-title: Logic programming with monotone cardinality atom publication-title: Proceedings of the 7th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR-7) – reference: W. Faber, Decomposition of nonmonotone aggregates in logic programming, in: M. Fink, H. Tompits, S. Woltran (Eds.), Proceedings of the 20th Workshop on Logic Programming (WLP 2006), Vienna, Austria, 2006, pp. 164–171. – volume: 29 start-page: 33 year: 1982 end-page: 57 ident: br0100 article-title: Non-monotonic logic II: Nonmonotonic modal theories publication-title: Journal of the ACM – volume: 29 start-page: 353 year: 2007 end-page: 389 ident: br0580 article-title: Answer sets for logic programs with arbitrary abstract constraint atoms publication-title: Journal of Artificial Intelligence Research – volume: vol. 1730 start-page: 107 year: 1999 end-page: 116 ident: br0430 article-title: Stable model semantics of weight constraint rules publication-title: Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR '99) – reference: T. Eiter, G. Ianni, R. Schindlauer, H. Tompits, A uniform integration of higher-order reasoning and external evaluations in answer set programming, in: International Joint Conference on Artificial Intelligence (IJCAI 2005), Edinburgh, UK, 2005, pp. 90–96. – start-page: 472 year: 2008 end-page: 479 ident: br0540 article-title: A reductive semantics for counting and choice in answer set programming publication-title: Proceedings of the 23rd National Conference on Artificial Intelligence (AAAI '08) – start-page: 89 year: 1988 end-page: 148 ident: br0410 article-title: Towards a theory of declarative knowledge publication-title: Foundations of Deductive Databases and Logic Programming – reference: N. Pelov, Semantics of logic programs with aggregates, Ph.D. thesis, Katholieke Universiteit Leuven, Leuven, Belgium, Apr. 2004. – volume: 7 start-page: 301 year: 2007 end-page: 353 ident: br0340 article-title: Well-founded and stable semantics of logic programs with aggregates publication-title: Theory and Practice of Logic Programming – volume: vol. 3662 start-page: 119 year: 2005 end-page: 131 ident: br0370 article-title: Answer sets for propositional theories publication-title: Logic Programming and Nonmonotonic Reasoning — 8th International Conference (LPNMR '05) – volume: 138 start-page: 181 year: 2002 end-page: 234 ident: br0160 article-title: Extending and implementing the stable model semantics publication-title: Artificial Intelligence – volume: vol. 1265 start-page: 290 year: 1997 end-page: 309 ident: br0510 article-title: Modular logic programming and generalized quantifiers publication-title: Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR '97) – volume: 22 start-page: 364 year: 1997 end-page: 418 ident: br0150 article-title: Disjunctive DATALOG publication-title: ACM Transactions on Database Systems – year: 2003 ident: br0130 article-title: Knowledge Representation, Reasoning and Declarative Problem Solving – volume: vol. 2408 start-page: 413 year: 2002 end-page: 451 ident: br0270 article-title: Representing knowledge in A-Prolog publication-title: Computational Logic. Logic Programming and Beyond – reference: V.W. Marek, J.B. Remmel, On logic programs with cardinality constraints, in: S. Benferhat, E. Giunchiglia (Eds.), Proceedings of the 9th International Workshop on Non-Monotonic Reasoning (NMR 2002), Toulouse, France, 2002, pp. 219–228. – volume: 38 start-page: 588 year: 1991 end-page: 619 ident: br0480 article-title: Autoepistemic logic publication-title: Journal of the ACM – start-page: 264 year: 1990 end-page: 277 ident: br0240 article-title: The magic of duplicates and aggregates publication-title: Proceedings of the 16th International Conference on Very Large Data Bases (VLDB '90) – volume: 28 start-page: 89 year: 1986 end-page: 116 ident: br0070 article-title: Applications of circumscription to formalizing common-sense knowledge publication-title: Artificial Intelligence – reference: T.C. Son, E. Pontelli, I. Elkabani, On logic programming with aggregates, Tech. Rep. NMSU-CS-2005-006, New Mexico State University, 2005. – volume: 157 start-page: 115 year: 2004 end-page: 137 ident: br0190 article-title: ASSAT: Computing answer sets of a logic program by SAT solvers publication-title: Artificial Intelligence – volume: vol. 3835 start-page: 95 year: 2005 end-page: 109 ident: br0220 article-title: The nomore++ approach to answer set solving publication-title: Logic for Programming, Artificial Intelligence, and Reasoning, 12th International Conference (LPAR 2005) – start-page: 211 year: 1975 end-page: 277 ident: br0050 article-title: A framework for representing knowledge publication-title: The Psychology of Computer Vision – volume: vol. 2173 start-page: 406 year: 2001 end-page: 410 ident: br0210 article-title: NoMoRe: A system for non-monotonic reasoning publication-title: Logic Programming and Nonmonotonic Reasoning — Proceedings of the 6th International Conference (LPNMR '01) – reference: T. Eiter, G. Ianni, H. Tompits, R. Schindlauer, Effective integration of declarative rules with external evaluations for semantic web reasoning, in: Proceedings of the 3rd European Semantic Web Conference (ESWC 2006), 2006, pp. 273–287. – volume: 9 start-page: 365 year: 1991 end-page: 385 ident: br0120 article-title: Classical negation in logic programs and disjunctive databases publication-title: New Generation Computing – year: 1989 ident: br0400 article-title: Principles of Database and Knowledge Base Systems – year: 2002 ident: br0390 article-title: ASSAT: Computing answer sets of a logic program by SAT solvers publication-title: Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI 2002) – volume: vol. 2923 start-page: 167 year: 2004 end-page: 179 ident: br0320 article-title: Set constraints in logic programming publication-title: Proceedings of the 7th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR-7) – start-page: 847 year: 2003 end-page: 852 ident: br0380 article-title: Aggregate functions in disjunctive logic programming: Semantics, complexity, and implementation in DLV publication-title: Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI) 2003 – volume: vol. 138 start-page: 292 year: 1982 ident: 10.1016/j.artint.2010.04.002_br0140 article-title: On indefinite data bases and the closed world assumption – start-page: 847 year: 2003 ident: 10.1016/j.artint.2010.04.002_br0380 article-title: Aggregate functions in disjunctive logic programming: Semantics, complexity, and implementation in DLV – volume: 29 start-page: 353 year: 2007 ident: 10.1016/j.artint.2010.04.002_br0580 article-title: Answer sets for logic programs with arbitrary abstract constraint atoms publication-title: Journal of Artificial Intelligence Research doi: 10.1613/jair.2171 – volume: vol. 1265 start-page: 290 year: 1997 ident: 10.1016/j.artint.2010.04.002_br0510 article-title: Modular logic programming and generalized quantifiers – start-page: 264 year: 1990 ident: 10.1016/j.artint.2010.04.002_br0240 article-title: The magic of duplicates and aggregates – ident: 10.1016/j.artint.2010.04.002_br0280 – volume: vol. 2923 start-page: 346 year: 2004 ident: 10.1016/j.artint.2010.04.002_br0200 article-title: Cmodels-2: SAT-based answer set solver enhanced to non-tight programs – ident: 10.1016/j.artint.2010.04.002_br0310 – volume: vol. 4 start-page: 463 year: 1969 ident: 10.1016/j.artint.2010.04.002_br0040 article-title: Some philosophical problems from the standpoint of artificial intelligence – year: 2003 ident: 10.1016/j.artint.2010.04.002_br0130 – volume: vol. 3835 start-page: 95 year: 2005 ident: 10.1016/j.artint.2010.04.002_br0220 article-title: The nomore++ approach to answer set solving – volume: 54 start-page: 79 issue: 1 year: 1997 ident: 10.1016/j.artint.2010.04.002_br0260 article-title: Monotonic aggregation in deductive databases publication-title: Journal of Computer and System Sciences doi: 10.1006/jcss.1997.1453 – ident: 10.1016/j.artint.2010.04.002_br0570 doi: 10.1007/11762256_22 – volume: vol. 2173 start-page: 406 year: 2001 ident: 10.1016/j.artint.2010.04.002_br0210 article-title: NoMoRe: A system for non-monotonic reasoning – start-page: 193 year: 1988 ident: 10.1016/j.artint.2010.04.002_br0420 article-title: On the declarative semantics of deductive databases and logic programs – start-page: 387 year: 1991 ident: 10.1016/j.artint.2010.04.002_br0250 article-title: Semantics of logic programs with aggregates – start-page: 89 year: 1988 ident: 10.1016/j.artint.2010.04.002_br0410 article-title: Towards a theory of declarative knowledge – volume: 97 start-page: 231 issue: 13 year: 1999 ident: 10.1016/j.artint.2010.04.002_br0460 article-title: Succinctness as a source of expression complexity publication-title: Annals of Pure and Applied Logic doi: 10.1016/S0168-0072(98)00057-8 – volume: vol. 2923 start-page: 154 year: 2004 ident: 10.1016/j.artint.2010.04.002_br0330 article-title: Logic programming with monotone cardinality atom – volume: 7 start-page: 355 year: 2007 ident: 10.1016/j.artint.2010.04.002_br0350 article-title: A constructive semantic characterization of aggregates in ASP publication-title: Theory and Practice of Logic Programming doi: 10.1017/S1471068406002936 – volume: 29 start-page: 33 issue: 1 year: 1982 ident: 10.1016/j.artint.2010.04.002_br0100 article-title: Non-monotonic logic II: Nonmonotonic modal theories publication-title: Journal of the ACM doi: 10.1145/322290.322293 – volume: 7 start-page: 301 issue: 3 year: 2007 ident: 10.1016/j.artint.2010.04.002_br0340 article-title: Well-founded and stable semantics of logic programs with aggregates publication-title: Theory and Practice of Logic Programming doi: 10.1017/S1471068406002973 – volume: vol. 2923 start-page: 167 year: 2004 ident: 10.1016/j.artint.2010.04.002_br0320 article-title: Set constraints in logic programming – volume: vol. 3662 start-page: 119 year: 2005 ident: 10.1016/j.artint.2010.04.002_br0370 article-title: Answer sets for propositional theories – ident: 10.1016/j.artint.2010.04.002_br0500 – volume: 25 start-page: 75 issue: 1 year: 1985 ident: 10.1016/j.artint.2010.04.002_br0110 article-title: Semantical considerations on nonmonotonic logic publication-title: Artificial Intelligence doi: 10.1016/0004-3702(85)90042-6 – volume: 7 start-page: 499 issue: 3 year: 2006 ident: 10.1016/j.artint.2010.04.002_br0180 article-title: The DLV system for knowledge representation and reasoning publication-title: ACM Transactions on Computational Logic doi: 10.1145/1149114.1149117 – volume: 33 start-page: 374 issue: 3 year: 2001 ident: 10.1016/j.artint.2010.04.002_br0450 article-title: Complexity and expressive power of logic programming publication-title: ACM Computing Surveys doi: 10.1145/502807.502810 – start-page: 472 year: 2008 ident: 10.1016/j.artint.2010.04.002_br0540 article-title: A reductive semantics for counting and choice in answer set programming – ident: 10.1016/j.artint.2010.04.002_br0020 – ident: 10.1016/j.artint.2010.04.002_br0030 – start-page: 1 year: 1973 ident: 10.1016/j.artint.2010.04.002_br0470 article-title: Word problems requiring exponential time: Preliminary report – volume: vol. 3229 start-page: 200 year: 2004 ident: 10.1016/j.artint.2010.04.002_br0010 article-title: Recursive aggregates in disjunctive logic programs: Semantics and complexity – start-page: 211 year: 1975 ident: 10.1016/j.artint.2010.04.002_br0050 article-title: A framework for representing knowledge – ident: 10.1016/j.artint.2010.04.002_br0440 – volume: 138 start-page: 181 year: 2002 ident: 10.1016/j.artint.2010.04.002_br0160 article-title: Extending and implementing the stable model semantics publication-title: Artificial Intelligence doi: 10.1016/S0004-3702(02)00187-X – start-page: 386 year: 2007 ident: 10.1016/j.artint.2010.04.002_br0230 article-title: Conflict-driven answer set solving – volume: 15 start-page: 289 issue: 3/4 year: 1995 ident: 10.1016/j.artint.2010.04.002_br0490 article-title: On the computational cost of disjunctive logic programming: Propositional case publication-title: Annals of Mathematics and Artificial Intelligence doi: 10.1007/BF01536399 – volume: 13 start-page: 41 issue: 1–2 year: 1980 ident: 10.1016/j.artint.2010.04.002_br0090 article-title: Non-monotonic logic I publication-title: Artificial Intelligence doi: 10.1016/0004-3702(80)90012-0 – volume: vol. 2923 start-page: 207 year: 2004 ident: 10.1016/j.artint.2010.04.002_br0290 article-title: Partial stable models for logic programs with aggregates – volume: 28 start-page: 89 issue: 1 year: 1986 ident: 10.1016/j.artint.2010.04.002_br0070 article-title: Applications of circumscription to formalizing common-sense knowledge publication-title: Artificial Intelligence doi: 10.1016/0004-3702(86)90032-9 – volume: 157 start-page: 115 issue: 12 year: 2004 ident: 10.1016/j.artint.2010.04.002_br0190 article-title: ASSAT: Computing answer sets of a logic program by SAT solvers publication-title: Artificial Intelligence doi: 10.1016/j.artint.2004.04.004 – volume: vol. 2408 start-page: 413 year: 2002 ident: 10.1016/j.artint.2010.04.002_br0270 article-title: Representing knowledge in A-Prolog – volume: 5 start-page: 45 issue: 1–2 year: 2005 ident: 10.1016/j.artint.2010.04.002_br0520 article-title: Weight constraints as nested expressions publication-title: Theory and Practice of Logic Programming doi: 10.1017/S1471068403001923 – volume: vol. 1730 start-page: 107 year: 1999 ident: 10.1016/j.artint.2010.04.002_br0430 article-title: Stable model semantics of weight constraint rules – volume: 7 start-page: 1 issue: 1 year: 2006 ident: 10.1016/j.artint.2010.04.002_br0170 article-title: Unfolding partiality and disjunctions in stable model semantics publication-title: ACM Transactions on Computational Logic doi: 10.1145/1119439.1119440 – year: 1989 ident: 10.1016/j.artint.2010.04.002_br0400 – ident: 10.1016/j.artint.2010.04.002_br0560 – volume: 9 start-page: 365 year: 1991 ident: 10.1016/j.artint.2010.04.002_br0120 article-title: Classical negation in logic programs and disjunctive databases publication-title: New Generation Computing doi: 10.1007/BF03037169 – ident: 10.1016/j.artint.2010.04.002_br0300 – ident: 10.1016/j.artint.2010.04.002_br0360 – ident: 10.1016/j.artint.2010.04.002_br0550 – year: 1990 ident: 10.1016/j.artint.2010.04.002_br0590 – volume: 22 start-page: 364 issue: 3 year: 1997 ident: 10.1016/j.artint.2010.04.002_br0150 article-title: Disjunctive DATALOG publication-title: ACM Transactions on Database Systems doi: 10.1145/261124.261126 – volume: 13 start-page: 81 issue: 1–2 year: 1980 ident: 10.1016/j.artint.2010.04.002_br0080 article-title: A logic for default reasoning publication-title: Artificial Intelligence doi: 10.1016/0004-3702(80)90014-4 – year: 2002 ident: 10.1016/j.artint.2010.04.002_br0390 article-title: ASSAT: Computing answer sets of a logic program by SAT solvers – volume: 38 start-page: 588 issue: 3 year: 1991 ident: 10.1016/j.artint.2010.04.002_br0480 article-title: Autoepistemic logic publication-title: Journal of the ACM doi: 10.1145/116825.116836 – volume: 13 start-page: 27 issue: 1–2 year: 1980 ident: 10.1016/j.artint.2010.04.002_br0060 article-title: Circumscription — A form of non-monotonic reasoning publication-title: Artificial Intelligence doi: 10.1016/0004-3702(80)90011-9 – volume: 25 start-page: 369 issue: 34 year: 1999 ident: 10.1016/j.artint.2010.04.002_br0530 article-title: Nested expressions in logic programs publication-title: Annals of Mathematics and Artificial Intelligence doi: 10.1023/A:1018978005636
SSID	ssj0003991
Score	2.4643812
Snippet	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...
SourceID	proquest crossref elsevier
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	278
SubjectTerms	Aggregates Answer set programming Complexity Computational complexity Indication Nonmonotonic reasoning Pictures Programming Proposals Recursive Semantics Transformations
Title	Semantics and complexity of recursive aggregates in answer set programming
URI	https://dx.doi.org/10.1016/j.artint.2010.04.002 https://www.proquest.com/docview/855711623
Volume	175
WOSCitedRecordID	wos000285947700012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-7921 dateEnd: 20180131 omitProxy: false ssIdentifier: ssj0003991 issn: 0004-3702 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1La9wwEBbtpode2vRFkjZBh15dbFleWcdQUtpQQiAp3ZuQLCkkJN6w65T9-Rk9ve1S0hYKxhhheVnNx7z0aQah921HSMm1LpRuTEE1bwoYsoW2lklS2oopXzL_Kzs5aWczfhp3TJe-nQDr-3a14rf_VdQwBsJ2R2f_Qtz5ozAAzyB0uIPY4f5Hgj8zN7Baqfiyp4ybVSReLFx23RPW5QUE2i6F5vmwYK8cWX5phkTYukkmLVeo9aQi3-JjrYpnFr9UQfbf59f2Qsa5TuVa48gzIf3u0l8jA2gekqkei3I9-1CNeYfNAzFRwVLQWWVQsCbo1JaBE8_DQeisdEO_lJ_QFVVoaOkTrTEJPao3FH3IOVx98LUWhkjRc4XQyWjYMt3wzG94Mhfe-q3Q2WO0RVjDywnaOvxyNDvOthvctdhjMfyNdNjSMwI3f-t3zswvZt37Kufb6FkMMvBhAMcL9Mj0L9Hz1MADR33-Ch1nrGDACh6xgucWZ6zgESv4sscBKxiwgtew8hp9-3R0_vFzEZtrFB0t6VBoPrVWtqZqZA1RK1dGS1drsePgwrGKlN1UaYh2G0qVIVqplnGja9tpw-HFun6DJj0AZQdhaukUHPcGPEtJbUu5nKpachiSnSGG7aI6rZLoYuV51wDlWiSK4ZUIayvc2oqSCljbXVTkWbeh8soD77MkABG9x-AVCsDMAzNxkpcA5ep2zGRv5ndL0TYNqyqIEPb--eNv0dOwDeGud2gyLO7MPnrS_Rgul4uDiL977F2lMw
linkProvider	Elsevier
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Semantics+and+complexity+of+recursive+aggregates+in+answer+set+programming&rft.jtitle=Artificial+intelligence&rft.au=Faber%2C+Wolfgang&rft.au=Pfeifer%2C+Gerald&rft.au=Leone%2C+Nicola&rft.date=2011&rft.pub=Elsevier+B.V&rft.issn=0004-3702&rft.eissn=1872-7921&rft.volume=175&rft.issue=1&rft.spage=278&rft.epage=298&rft_id=info:doi/10.1016%2Fj.artint.2010.04.002&rft.externalDocID=S000437021000038X
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0004-3702&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0004-3702&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0004-3702&client=summon