{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:21:51Z","timestamp":1760170911289},"reference-count":24,"publisher":"Cambridge University Press (CUP)","issue":"4-5","license":[{"start":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T00:00:00Z","timestamp":1405900800000},"content-version":"unspecified","delay-in-days":20,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2014,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The paper presents a knowledge representation language <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S1471068414000222_inline1\" \/><jats:tex-math>$\\mathcal{A}log$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> which extends ASP with aggregates. The goal is to have a language based on simple syntax and clear intuitive and mathematical semantics. We give some properties of <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S1471068414000222_inline1\" \/><jats:tex-math>$\\mathcal{A}log$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>, an algorithm for computing its answer sets, and comparison with other approaches.<\/jats:p>","DOI":"10.1017\/s1471068414000222","type":"journal-article","created":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T11:52:50Z","timestamp":1405943570000},"page":"587-601","source":"Crossref","is-referenced-by-count":28,"title":["Vicious Circle Principle and Logic Programs with Aggregates"],"prefix":"10.1017","volume":"14","author":[{"given":"MICHAEL","family":"GELFOND","sequence":"first","affiliation":[]},{"given":"YUANLIN","family":"ZHANG","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2014,7,21]]},"reference":[{"key":"S1471068414000222_ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2009.11.016"},{"key":"S1471068414000222_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45632-5_16"},{"key":"S1471068414000222_ref14","unstructured":"Harrison A. , Lifschitz V. , and Yang F. 2013. On the semantics of gringo. In Working Notes of the Workshop on Answer Set Programming and Other Computing Paradigms."},{"key":"S1471068414000222_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"S1471068414000222_ref8","doi-asserted-by":"crossref","unstructured":"Gebser M. , Kaminski R. , Kaufmann B. , and Schaub T. 2009. On the implementation of weight constraint rules in conflict-driven asp solvers. In ICLP. 250\u2013264.","DOI":"10.1007\/978-3-642-02846-5_23"},{"key":"S1471068414000222_ref20","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0004-3702(02)00187-X","article-title":"Extending and implementing the stable model semantics.","volume":"138","author":"Niemela","year":"2002","journal-title":"Artificial Intelligence"},{"key":"S1471068414000222_ref1","doi-asserted-by":"crossref","unstructured":"Balai E. , Gelfond M. , and Zhang Y. 2013. Towards answer set programming with sorts. In LPNMR. 135\u2013147.","DOI":"10.1007\/978-3-642-40564-8_14"},{"key":"S1471068414000222_ref22","first-page":"294","article-title":"Les mathematiques et la logique.","volume":"14","author":"Poincare","year":"1906","journal-title":"Review de metaphysique et de morale"},{"key":"S1471068414000222_ref3","unstructured":"Erdem E. , Lee J. , and Lierler Y. 2012. Theory and practice of answer set programming. AAAI-2012 Tutorial (http:\/\/peace.eas.asu.edu\/aaai12tutorial\/asp-tutorial-aaai.pdf)."},{"key":"S1471068414000222_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(03)00078-X"},{"key":"S1471068414000222_ref21","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068406002973"},{"key":"S1471068414000222_ref5","first-page":"545","article-title":"Design and implementation of aggregate functions in the dlv system","volume":"8","author":"Faber","year":"2008","journal-title":"TPLP"},{"key":"S1471068414000222_ref6","unstructured":"Feferman S. 2002. Predicativity. http:\/\/math.stanford.edu\/~feferman\/papers\/"},{"key":"S1471068414000222_ref12","unstructured":"Gelfond M. and Lifschitz V. 1988. The stable model semantics for logic programming. In Proceedings of ICLP-88. 1070\u20131080."},{"key":"S1471068414000222_ref15","first-page":"387","volume-title":"ISLP","author":"Kemp","year":"1991"},{"key":"S1471068414000222_ref19","unstructured":"Marek V. W. , Truszczynski M. , et al. 2004. Logic programs with abstract constraint atoms. In AAAI. Vol. 4. 86\u201391."},{"key":"S1471068414000222_ref7","doi-asserted-by":"crossref","unstructured":"Ferraris P. 2005. Answer sets for propositional theories. In LPNMR. 119\u2013131.","DOI":"10.1007\/11546207_10"},{"key":"S1471068414000222_ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2043174.2043195"},{"key":"S1471068414000222_ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72200-7_13"},{"key":"S1471068414000222_ref11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139342124"},{"key":"S1471068414000222_ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1149114.1149117"},{"key":"S1471068414000222_ref23","first-page":"355","article-title":"A constructive semantic characterization of aggregates in answer set programming.","volume":"7","author":"Son","year":"2007","journal-title":"TPLP"},{"key":"S1471068414000222_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.04.002"},{"key":"S1471068414000222_ref24","unstructured":"Wang Y. , Lin F. , Zhang M. , and You J.-H. 2012. A well-founded semantics for basic logic programs with arbitrary abstract constraint atoms. In AAAI."}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068414000222","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T19:05:40Z","timestamp":1555959940000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068414000222\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7]]},"references-count":24,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["S1471068414000222"],"URL":"https:\/\/doi.org\/10.1017\/s1471068414000222","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7]]}}}