{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:01:41Z","timestamp":1743015701083,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030195694"},{"type":"electronic","value":"9783030195700"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19570-0_30","type":"book-chapter","created":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T12:27:54Z","timestamp":1557145674000},"page":"462-478","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Chain Answer Sets for Logic Programs with Generalized Atoms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2052-2063","authenticated-orcid":false,"given":"Mario","family":"Alviano","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0330-5868","authenticated-orcid":false,"given":"Wolfgang","family":"Faber","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,6]]},"reference":[{"key":"30_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-40564-8_6","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Alviano","year":"2013","unstructured":"Alviano, M., Dodaro, C., Faber, W., Leone, N., Ricca, F.: WASP: a native ASP solver based on constraint learning. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS (LNAI), vol. 8148, pp. 54\u201366. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-40564-8_6"},{"issue":"4\u20135","key":"30_CR2","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1017\/S1471068414000325","volume":"14","author":"M Alviano","year":"2014","unstructured":"Alviano, M., Dodaro, C., Ricca, F.: Anytime computation of cautious consequences in answer set programming. TPLP 14(4\u20135), 755\u2013770 (2014). \n                      https:\/\/doi.org\/10.1017\/S1471068414000325","journal-title":"TPLP"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-40564-8_7","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Alviano","year":"2013","unstructured":"Alviano, M., Faber, W.: The complexity boundary of answer set programming with generalized atoms under the FLP semantics. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS (LNAI), vol. 8148, pp. 67\u201372. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-40564-8_7"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-319-22002-4_4","volume-title":"Web Reasoning and Rule Systems","author":"M Alviano","year":"2015","unstructured":"Alviano, M., Faber, W.: Supportedly stable answer sets for logic programs with generalized atoms. In: ten Cate, B., Mileo, A. (eds.) RR 2015. LNCS, vol. 9209, pp. 30\u201344. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-22002-4_4"},{"key":"30_CR5","unstructured":"Alviano, M., Faber, W.: Chain answer sets for logic programs with generalized atoms - how not to fix a semantic problem. In: Proceedings of the Second Workshop on Answer Set Programming and Other Computing Paradigms (TAASP 2018) (2018)"},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-642-24206-9_17","volume-title":"Datalog Reloaded","author":"M Alviano","year":"2011","unstructured":"Alviano, M., Faber, W., Leone, N., Perri, S., Pfeifer, G., Terracina, G.: The disjunctive datalog system DLV. In: de Moor, O., Gottlob, G., Furche, T., Sellers, A. (eds.) Datalog 2.0 2010. LNCS, vol. 6702, pp. 282\u2013301. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-24206-9_17"},{"issue":"3\u20134","key":"30_CR7","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s10472-007-9076-z","volume":"50","author":"F Calimeri","year":"2007","unstructured":"Calimeri, F., Cozza, S., Ianni, G.: External sources of knowledge and value invention in logic programming. Ann. Math. Artif. Intell. 50(3\u20134), 333\u2013361 (2007)","journal-title":"Ann. Math. Artif. Intell."},{"key":"30_CR8","unstructured":"Dell\u2019Armi, T., Faber, W., Ielpa, G., Leone, N., Pfeifer, G.: Aggregate functions in disjunctive logic programming: semantics, complexity, and implementation in DLV. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence, IJCAI 2003, pp. 847\u2013852. Morgan Kaufmann Publishers, Acapulco, August 2003"},{"issue":"4","key":"30_CR9","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1017\/S1471068415000113","volume":"16","author":"T Eiter","year":"2016","unstructured":"Eiter, T., Fink, M., Ianni, G., Krennwallner, T., Redl, C., Sch\u00fcller, P.: A model building framework for answer set programming with external computations. TPLP 16(4), 418\u2013464 (2016). \n                      https:\/\/doi.org\/10.1017\/S1471068415000113","journal-title":"TPLP"},{"issue":"12\u201313","key":"30_CR10","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1016\/j.artint.2008.04.002","volume":"172","author":"T Eiter","year":"2008","unstructured":"Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining answer set programming with description logics for the semantic web. Artif. Intell. 172(12\u201313), 1495\u20131539 (2008). \n                      https:\/\/doi.org\/10.1016\/j.artint.2008.04.002","journal-title":"Artif. Intell."},{"key":"30_CR11","unstructured":"Eiter, T., Ianni, G., Schindlauer, R., Tompits, H.: 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, pp. 90\u201396, August 2005"},{"key":"30_CR12","unstructured":"Eiter, T., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining answer set programming with description logics for the semantic web. In: Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference (KR 2004), Whistler, Canada, pp. 141\u2013151 (2004). Extended Report RR-1843-03-13. Institut f\u00fcr Informationssysteme, TU Wien (2003)"},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-30227-8_19","volume-title":"Logics in Artificial Intelligence","author":"W Faber","year":"2004","unstructured":"Faber, W., Leone, N., Pfeifer, G.: Recursive aggregates in disjunctive logic programs: semantics and complexity. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 200\u2013212. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-30227-8_19"},{"issue":"1","key":"30_CR14","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.artint.2010.04.002","volume":"175","author":"Wolfgang Faber","year":"2011","unstructured":"Faber, W., Leone, N., Pfeifer, G.: Semantics and complexity of recursive aggregates in answer set programming. Artif. Intell. 175(1), 278\u2013298 (2011). \n                      https:\/\/doi.org\/10.1016\/j.artint.2010.04.002\n                      \n                    . Special Issue: John McCarthy\u2019s Legacy","journal-title":"Artificial Intelligence"},{"issue":"5\u20136","key":"30_CR15","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1017\/S1471068408003323","volume":"8","author":"W Faber","year":"2008","unstructured":"Faber, W., Pfeifer, G., Leone, N., Dell\u2019Armi, T., Ielpa, G.: Design and implementation of aggregate functions in the DLV system. Theory Practice Logic Program. 8(5\u20136), 545\u2013580 (2008). \n                      https:\/\/doi.org\/10.1017\/S1471068408003323","journal-title":"Theory Practice Logic Program."},{"issue":"4","key":"30_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1970398.1970401","volume":"12","author":"Paolo Ferraris","year":"2011","unstructured":"Ferraris, P.: Logic programs with propositional connectives and aggregates. ACM Trans. Comput. Log. 12(4), 25 (2011). \n                      https:\/\/doi.org\/10.1145\/1970398.1970401","journal-title":"ACM Transactions on Computational Logic"},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.artint.2012.04.001","volume":"187","author":"M Gebser","year":"2012","unstructured":"Gebser, M., Kaufmann, B., Schaub, T.: Conflict-driven answer set solving: from theory to practice. Artif. Intell. 187, 52\u201389 (2012)","journal-title":"Artif. Intell."},{"key":"30_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-540-24609-1_32","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"Y Lierler","year":"2003","unstructured":"Lierler, Y., Maratea, M.: Cmodels-2: SAT-based answer set solver enhanced to non-tight programs. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 346\u2013350. Springer, Heidelberg (2003). \n                      https:\/\/doi.org\/10.1007\/978-3-540-24609-1_32"},{"key":"30_CR19","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/978-1-4615-1567-8_21","volume-title":"Logic-Based Artificial Intelligence","author":"Ilkka Niemel\u00e4","year":"2000","unstructured":"Niemel\u00e4, I., Simons, P.: Extending the Smodels system with cardinality and weight constraints. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 491\u2013521. Kluwer Academic Publishers, Dordrecht (2000). \n                      citeseer.ist.psu.edu\/niemel00extending.html"},{"key":"30_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/3-540-46767-X_23","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"I Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I., Simons, P., Soininen, T.: Stable model semantics of weight constraint rules. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol. 1730, pp. 317\u2013331. Springer, Heidelberg (1999). \n                      https:\/\/doi.org\/10.1007\/3-540-46767-X_23"},{"key":"30_CR21","unstructured":"Pelov, N.: Semantics of logic programs with aggregates. Ph.D. thesis, Katholieke Universiteit Leuven, Leuven, Belgium, April 2004"},{"issue":"3","key":"30_CR22","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1017\/S1471068406002973","volume":"7","author":"N Pelov","year":"2007","unstructured":"Pelov, N., Denecker, M., Bruynooghe, M.: Well-founded and stable semantics of logic programs with aggregates. Theory Practice Logic Program. 7(3), 301\u2013353 (2007)","journal-title":"Theory Practice Logic Program."},{"key":"30_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2014.05.001","volume":"213","author":"Y Shen","year":"2014","unstructured":"Shen, Y., et al.: FLP answer set semantics without circular justifications for general logic programs. Artif. Intell. 213, 1\u201341 (2014). \n                      https:\/\/doi.org\/10.1016\/j.artint.2014.05.001","journal-title":"Artif. Intell."},{"key":"30_CR24","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1017\/S1471068406002936","volume":"7","author":"TC Son","year":"2007","unstructured":"Son, T.C., Pontelli, E.: A constructive semantic characterization of aggregates in ASP. Theory Practice Logic Program. 7, 355\u2013375 (2007)","journal-title":"Theory Practice Logic Program."}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19570-0_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:39:38Z","timestamp":1558348778000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19570-0_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030195694","9783030195700"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19570-0_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JELIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Logics in Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rende","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jelia2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/jelia2019.mat.unical.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}