{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:48:04Z","timestamp":1725536884792},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642042379"},{"type":"electronic","value":"9783642042386"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04238-6_17","type":"book-chapter","created":{"date-parts":[[2009,8,31]],"date-time":"2009-08-31T04:23:01Z","timestamp":1251692581000},"page":"182-195","source":"Crossref","is-referenced-by-count":12,"title":["On Reductive Semantics of Aggregates in Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Joohyung","family":"Lee","sequence":"first","affiliation":[]},{"given":"Yunsong","family":"Meng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1023\/A:1018978005636","volume":"25","author":"V. Lifschitz","year":"1999","unstructured":"Lifschitz, V., Tang, L.R., Turner, H.: Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence\u00a025, 369\u2013389 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"17_CR2","series-title":"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.\u00a03229, pp. 200\u2013212. Springer, Heidelberg (2004)"},{"key":"17_CR3","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1613\/jair.2171","volume":"29","author":"T.C. Son","year":"2007","unstructured":"Son, T.C., Pontelli, E., Tu, P.H.: Answer sets for logic programs with arbitrary abstract constraint atoms. J. Artif. Intell. Res. (JAIR)\u00a029, 353\u2013389 (2007)","journal-title":". J. Artif. Intell. Res. (JAIR)"},{"key":"17_CR4","unstructured":"Pelov, N., Denecker, M., Bruynooghe, M.: Translation of aggregate programs to normal logic programs. In: Proc.\u00a0Answer Set Programming (2003)"},{"issue":"3","key":"17_CR5","first-page":"355","volume":"7","author":"T.C. Son","year":"2007","unstructured":"Son, T.C., Pontelli, E.: A constructive semantic characterization of aggregates in answer set programming. TPLP\u00a07(3), 355\u2013375 (2007)","journal-title":"TPLP"},{"key":"17_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/11546207_10","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"P. Ferraris","year":"2005","unstructured":"Ferraris, P.: Answer sets for propositional theories. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol.\u00a03662, pp. 119\u2013131. Springer, Heidelberg (2005)"},{"key":"17_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BFb0023801","volume-title":"Non-Monotonic Extensions of Logic Programming","author":"D. Pearce","year":"1997","unstructured":"Pearce, D.: A new logical characterization of stable models and answer sets. In: Dix, J., Pereira, L., Przymusinski, T. (eds.) NMELP 1996. LNCS (LNAI), vol.\u00a01216, pp. 57\u201370. Springer, Heidelberg (1997)"},{"key":"17_CR8","unstructured":"Ferraris, P., Lee, J., Lifschitz, V.: A new perspective on stable models. In: Proc.\u00a0International Joint Conference on Artificial Intelligence (IJCAI), pp. 372\u2013379 (2007)"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10472-006-9025-2","volume":"47","author":"P. Ferraris","year":"2006","unstructured":"Ferraris, P., Lee, J., Lifschitz, V.: A generalization of the Lin-Zhao theorem. Annals of Mathematics and Artificial Intelligence\u00a047, 79\u2013101 (2006)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"17_CR10","first-page":"1070","volume-title":"Proceedings of International Logic Programming Conference and Symposium","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Proceedings of International Logic Programming Conference and Symposium, pp. 1070\u20131080. MIT Press, Cambridge (1988)"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1145\/383779.383783","volume":"2","author":"V. Lifschitz","year":"2001","unstructured":"Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transactions on Computational Logic\u00a02, 526\u2013541 (2001)","journal-title":"ACM Transactions on Computational Logic"},{"key":"17_CR12","unstructured":"Lee, J., Meng, Y.: On loop formulas with variables. In: Proc.\u00a0International Conference on Knowledge Representation and Reasoning (KR), pp. 444\u2013453 (2008)"},{"key":"17_CR13","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1613\/jair.2009","volume":"27","author":"L. Liu","year":"2006","unstructured":"Liu, L., Truszczynski, M.: Properties and applications of programs with monotone and convex constraints. J. Artif. Intell. Res. (JAIR)\u00a027, 299\u2013334 (2006)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"17_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/11546207_4","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"W. Faber","year":"2005","unstructured":"Faber, W.: Unfounded sets for disjunctive logic programs with arbitrary aggregates. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol.\u00a03662, pp. 40\u201352. Springer, Heidelberg (2005)"},{"key":"17_CR15","unstructured":"You, J.H., Liu, G.: Loop formulas for logic programs with arbitrary constraint atoms. In: Proc.\u00a0AAAI Conference on Artificial Intelligence (AAAI), pp. 584\u2013589 (2008)"},{"key":"17_CR16","unstructured":"Lee, J., Lifschitz, V., Palla, R.: A reductive semantics for counting and choice in answer set programming. In: Proc.\u00a0AAAI Conference on Artificial Intelligence (AAAI), pp. 472\u2013479 (2008)"}],"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-642-04238-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T11:39:25Z","timestamp":1552131565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04238-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642042379","9783642042386"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04238-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}