{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:48:58Z","timestamp":1740098938232,"version":"3.37.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319616599"},{"type":"electronic","value":"9783319616605"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-61660-5_14","type":"book-chapter","created":{"date-parts":[[2017,6,27]],"date-time":"2017-06-27T05:22:22Z","timestamp":1498540942000},"page":"146-159","source":"Crossref","is-referenced-by-count":4,"title":["Vicious Circle Principle and Formation of Sets in ASP Based Languages"],"prefix":"10.1007","author":[{"given":"Michael","family":"Gelfond","sequence":"first","affiliation":[]},{"given":"Yuanlin","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,28]]},"reference":[{"key":"14_CR1","unstructured":"Alviano, M., Faber, W.: Stable model semantics of abstract dialectical frameworks revisited: a logic programming perspective. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI Organization, Buenos Aires, Argentina, pp. 2684\u20132690 (2015)"},{"issue":"4\u20135","key":"14_CR2","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1017\/S1471068415000228","volume":"15","author":"M Alviano","year":"2015","unstructured":"Alviano, M., Faber, W., Gebser, M.: Rewriting recursive aggregates in answer set programming: back to monotonicity. Theory Pract. Logic Program. 15(4\u20135), 559\u2013573 (2015)","journal-title":"Theory Pract. Logic Program."},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-540-24599-5_20","volume-title":"Logic Programming","author":"A Dovier","year":"2003","unstructured":"Dovier, A., Pontelli, E., Rossi, G.: Intensional sets in CLP. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol. 2916, pp. 284\u2013299. Springer, Heidelberg (2003). doi:\n10.1007\/978-3-540-24599-5_20"},{"issue":"1","key":"14_CR4","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/j.artint.2010.04.002","volume":"175","author":"W Faber","year":"2011","unstructured":"Faber, W., Pfeifer, G., Leone, N.: Semantics and complexity of recursive aggregates in answer set programming. Artif. Intell. 175(1), 278\u2013298 (2011)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"14_CR5","first-page":"45","volume":"5","author":"P Ferraris","year":"2005","unstructured":"Ferraris, P., Lifschitz, V.: Weight constraints as nested expressions. TPLP 5(1\u20132), 45\u201374 (2005)","journal-title":"TPLP"},{"issue":"4\u20135","key":"14_CR6","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1017\/S1471068415000150","volume":"15","author":"M Gebser","year":"2015","unstructured":"Gebser, M., Harrison, A., Kaminski, R., Lifschitz, V., Schaub, T.: Abstract gringo. Theory Pract. Logic Program. 15(4\u20135), 449\u2013463 (2015)","journal-title":"Theory Pract. Logic Program."},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/3-540-45632-5_16","volume-title":"Computational Logic: Logic Programming and Beyond","author":"M Gelfond","year":"2002","unstructured":"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\u2013451. Springer, Heidelberg (2002). doi:\n10.1007\/3-540-45632-5_16"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-20895-9_29","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gelfond","year":"2011","unstructured":"Gelfond, M.: New semantics for epistemic specifications. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 260\u2013265. Springer, Heidelberg (2011). doi:\n10.1007\/978-3-642-20895-9_29"},{"key":"14_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139342124","volume-title":"Knowledge Representation, Reasoning, and the Design of Intelligent Agents","author":"M Gelfond","year":"2014","unstructured":"Gelfond, M., Kahl, Y.: Knowledge Representation, Reasoning, and the Design of Intelligent Agents. Cambridge University Press, Cambridge (2014)"},{"issue":"3\/4","key":"14_CR10","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9(3\/4), 365\u2013386 (1991)","journal-title":"New Gener. Comput."},{"issue":"1","key":"14_CR11","first-page":"59","volume":"16","author":"M Gelfond","year":"1992","unstructured":"Gelfond, M., Przymusinska, H.: On consistency and completeness of autoepistemic theories. Fundam. Inf. 16(1), 59\u201392 (1992)","journal-title":"Fundam. Inf."},{"issue":"4\u20135","key":"14_CR12","first-page":"587","volume":"14","author":"M Gelfond","year":"2014","unstructured":"Gelfond, M., Zhang, Y.: Vicious circle principle and logic programs with aggregates. TPLP 14(4\u20135), 587\u2013601 (2014). \nhttp:\/\/dx.doi.org\/10.1017\/S1471068414000222","journal-title":"TPLP"},{"key":"14_CR13","unstructured":"Harrison, A.J., Lifschitz, V., Yang, F.: The semantics of gringo and infinitary propositional formulas. In: KR (2014)"},{"key":"14_CR14","unstructured":"Lee, J., Lifschitz, V., Palla, R.: A reductive semantics for counting and choice in answer set programming. In: Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008, Chicago, Illinois, USA, 13\u201317 July 2008, pp. 472\u2013479 (2008). \nhttp:\/\/www.aaai.org\/Library\/AAAI\/2008\/aaai08-075.php"},{"key":"14_CR15","unstructured":"Lifschitz, V., Turner, H.: Splitting a logic program. In: Proceedings of the 11th International Conference on Logic Programming (ICLP 1994), pp. 23\u201338 (1994)"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-642-20895-9_15","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"G Liu","year":"2011","unstructured":"Liu, G., Goebel, R., Janhunen, T., Niemel\u00e4, I., You, J.-H.: Strong equivalence of logic programs with abstract constraint atoms. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 161\u2013173. Springer, Heidelberg (2011). doi:\n10.1007\/978-3-642-20895-9_15"},{"issue":"3\u20134","key":"14_CR17","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/j.artint.2009.11.016","volume":"174","author":"L Liu","year":"2010","unstructured":"Liu, L., Pontelli, E., Son, T.C., Truszczynski, M.: Logic programs with abstract constraint atoms: the role of computations. Artif. Intell. 174(3\u20134), 295\u2013315 (2010)","journal-title":"Artif. Intell."},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-540-24609-1_16","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"VW Marek","year":"2003","unstructured":"Marek, V.W., Remmel, J.B.: Set constraints in logic programming. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS, vol. 2923, pp. 167\u2013179. Springer, Heidelberg (2003). doi:\n10.1007\/978-3-540-24609-1_16"},{"issue":"1\u20132","key":"14_CR19","first-page":"181","volume":"138","author":"I Niemela","year":"2002","unstructured":"Niemela, I., Simons, P., Soininen, T.: Extending and implementing the stable model semantics. Artif. Intell. 138(1\u20132), 181\u2013234 (2002)","journal-title":"Artif. Intell."},{"key":"14_CR20","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1017\/S1471068406002936","volume":"7","author":"N Pelov","year":"2007","unstructured":"Pelov, N., Denecker, M., Bruynooghe, M.: Well-fouded and stable semantics of logic programs with aggregates. Theory Pract. Logic Program. 7, 355\u2013375 (2007)","journal-title":"Theory Pract. Logic Program."},{"key":"14_CR21","first-page":"294","volume":"14","author":"H Poincare","year":"1906","unstructured":"Poincare, H.: Les mathematiques et la logique. Rev. de metaphysique et de morale 14, 294\u2013317 (1906)","journal-title":"Rev. de metaphysique et de morale"},{"issue":"3","key":"14_CR22","doi-asserted-by":"crossref","first-page":"222","DOI":"10.2307\/2369948","volume":"30","author":"B Russell","year":"1908","unstructured":"Russell, B.: Mathematical logic as based on the theory of types. Am. J. Math. 30(3), 222\u2013262 (1908)","journal-title":"Am. J. Math."},{"issue":"4","key":"14_CR23","first-page":"529","volume":"9","author":"Y Shen","year":"2009","unstructured":"Shen, Y., You, J., Yuan, L.: Characterizations of stable model semantics for logic programs with arbitrary constraint atoms. TPLP 9(4), 529\u2013564 (2009)","journal-title":"TPLP"},{"issue":"3","key":"14_CR24","first-page":"355","volume":"7","author":"TC Son","year":"2007","unstructured":"Son, T.C., Pontelli, E.: A constructive semantic characterization of aggregates in answer set programming. TPLP 7(3), 355\u2013375 (2007)","journal-title":"TPLP"},{"key":"14_CR25","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.artint.2013.09.004","volume":"205","author":"H Strass","year":"2013","unstructured":"Strass, H.: Approximating operators and semantics for abstract dialectical frameworks. Artif. Intell. 205, 39\u201370 (2013)","journal-title":"Artif. Intell."},{"key":"14_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-642-30743-0_37","volume-title":"Correct Reasoning","author":"M Truszczynski","year":"2012","unstructured":"Truszczynski, M.: Connecting first-order ASP and the logic FO(ID) through reducts. In: Erdem, E., Lee, J., Lierler, Y., Pearce, D. (eds.) Correct Reasoning. LNCS, vol. 7265, pp. 543\u2013559. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-30743-0_37"},{"key":"14_CR27","unstructured":"Turner, H.: Splitting a default theory. In: Proceedings of AAAI 1996, pp. 645\u2013651 (1996)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-61660-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,27]],"date-time":"2017-06-27T05:26:38Z","timestamp":1498541198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-61660-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319616599","9783319616605"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-61660-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}