{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:43:58Z","timestamp":1725522238711},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540899815"},{"type":"electronic","value":"9783540899822"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89982-2_33","type":"book-chapter","created":{"date-parts":[[2008,12,15]],"date-time":"2008-12-15T03:09:15Z","timestamp":1229310555000},"page":"347-361","source":"Crossref","is-referenced-by-count":4,"title":["Lparse Programs Revisited: Semantics and Representation of Aggregates"],"prefix":"10.1007","author":[{"given":"Guohua","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia-Huai","family":"You","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"7","key":"33_CR1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A. Aggoun","year":"1993","unstructured":"Aggoun, A., Beldiceanu, N.: Extending CHIP in order to solve complex scheduling and placement problems. J. Mathematical and Computer Modelling\u00a017(7), 57\u201373 (1993)","journal-title":"J. Mathematical and Computer Modelling"},{"key":"33_CR2","unstructured":"Armi, D., Faber, W., Ielpa, G.: Aggregate functions in disjunctive logic programming: Semantics, complexity, and implementation in DLV*. In: IJCAI 2003, pp. 847\u2013852 (2003)"},{"key":"33_CR3","unstructured":"Calimeri, F., Faber, W., Leone, N., Perri, S.: Declarative and computational properties of logic programs with aggregates. In: IJCAI 2005, pp. 406\u2013411 (2005)"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/11546207_40","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"I. Elkabani","year":"2005","unstructured":"Elkabani, I., Pontelli, E., Son, T.C.: Smodels\n                    \n                      A\n                     \u2013 a system for computing answer sets of logic programs with aggregates. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS, vol.\u00a03662, pp. 427\u2013431. Springer, Heidelberg (2005)"},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science","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. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS, vol.\u00a03229, pp. 200\u2013212. Springer, Heidelberg (2004)"},{"key":"33_CR6","first-page":"51","volume":"1","author":"F. Fages","year":"1994","unstructured":"Fages, F.: Consistency of Clark\u2019s completion and existence of stable models. J. Methods of Logic in Computer Science\u00a01, 51\u201360 (1994)","journal-title":"J. Methods of Logic in Computer Science"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","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, vol.\u00a03662, pp. 119\u2013131. Springer, Heidelberg (2005)"},{"key":"33_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-72200-7_1","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Gebser","year":"2007","unstructured":"Gebser, M., Liu, L., Namasivayam, G., Neumann, A., Schaub, T., Truszczy\u0144ski, M.: The first answer set programming system competition. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS, vol.\u00a04483, pp. 1\u201317. Springer, Heidelberg (2007)"},{"key":"33_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-540-74610-2_20","volume-title":"Logic Programming","author":"L. Liu","year":"2007","unstructured":"Liu, L., Pontelli, E., Son, T.C., Truszczy\u0144ski, M.: Logic programs with abstract constraint atoms: The role of computations. In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007. LNCS, vol.\u00a04670, pp. 286\u2013301. Springer, Heidelberg (2007)"},{"key":"33_CR10","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1613\/jair.2009","volume":"7","author":"L. Liu","year":"2006","unstructured":"Liu, L., Truszczy\u0144ski, M.: Properties and applications of programs with monotone and convex constraints. J. Artificial Intelligence Research\u00a07, 299\u2013334 (2006)","journal-title":"J. Artificial Intelligence Research"},{"issue":"2","key":"33_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1017\/S147106840700302X","volume":"8","author":"V. Marek","year":"2008","unstructured":"Marek, V., Niemel\u00e4, I., Truszczy\u0144ski, M.: Logic programs with monotone abstract constraint atoms. J. Theory and Practice of Logic Programming\u00a08(2), 167\u2013199 (2008)","journal-title":"J. Theory and Practice of Logic Programming"},{"key":"33_CR12","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":"V.W. 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.\u00a02923, pp. 167\u2013179. Springer, Heidelberg (2003)"},{"issue":"3-4","key":"33_CR13","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I. Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic programs with stable model semantics as a constraint programming paradigm. Annals of Math. and Artificial Intelligence\u00a025(3-4), 241\u2013273 (1999)","journal-title":"Annals of Math. and Artificial Intelligence"},{"key":"33_CR14","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. J. Theory and Practice of Logic Programming\u00a07, 301\u2013353 (2007)","journal-title":"J. Theory and Practice of Logic Programming"},{"issue":"1-2","key":"33_CR15","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0004-3702(02)00187-X","volume":"138","author":"P. Simons","year":"2002","unstructured":"Simons, P., Niemel\u00e4, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence\u00a0138(1-2), 181\u2013234 (2002)","journal-title":"Artificial Intelligence"},{"key":"33_CR16","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. Artificial Intelligence Research\u00a029, 353\u2013389 (2007)","journal-title":"J. Artificial Intelligence Research"},{"key":"33_CR17","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1017\/S1471068406002936","volume":"7","author":"T.C. Son","year":"2006","unstructured":"Son, T.C., Pontelli, E.: A constructive semantic characterization of aggregates in answer set programming. J. Theory and Practice of Logic Programming\u00a07, 355\u2013375 (2006)","journal-title":"J. Theory and Practice of Logic Programming"},{"issue":"3","key":"33_CR18","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Gelder van","year":"1991","unstructured":"van Gelder, A., Ross, K., Schlipf, J.: The well-founded semantics for general logic programs. J. ACM\u00a038(3), 620\u2013650 (1991)","journal-title":"J. ACM"},{"key":"33_CR19","volume-title":"Handbook of Constraint Programming, Ch. 7","author":"W.-J. Hoeve van","year":"2006","unstructured":"van Hoeve, W.-J., Katriel, I.: Global constraints. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, Ch. 7. Elsevier, Amsterdam (2006)"},{"issue":"1","key":"33_CR20","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1109\/TCBB.2007.1008","volume":"4","author":"G. Wu","year":"2007","unstructured":"Wu, G., You, J., Lin, G.: Quartet based phylogeny reconstruction with answer set programming. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a04(1), 139\u2013152 (2007)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89982-2_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T12:20:25Z","timestamp":1551702025000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89982-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540899815","9783540899822"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89982-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}