{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:27:14Z","timestamp":1725575234190},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540207214"},{"type":"electronic","value":"9783540246091"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24609-1_19","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T03:31:31Z","timestamp":1294975891000},"page":"207-219","source":"Crossref","is-referenced-by-count":7,"title":["Partial Stable Models for Logic Programs with Aggregates"],"prefix":"10.1007","author":[{"given":"Nikolay","family":"Pelov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Denecker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Bruynooghe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","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: Proc. of the 18th Int. Joint Conference on Artificial Intelligence (2003)"},{"key":"19_CR2","unstructured":"Dell\u2019Armi, T., Faber, W., Ielpa, G., Leone, N., Pfeifer, G.: Aggregate functions in DLV. Answer Set Programming: Advances in Theory and Implementation, 274\u2013288 (2003), online CEUR-WS.org\/Vol-78\/"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Denecker, M., Marek, V., Truszczy\u0144ski, M.: Approximating operators, stable operators, well-founded fixpoints and applications in non-monotonic reasoning. In: Minker, J. (ed.) Logic-based Artificial Intelligence, pp. 127\u2013144 (2000)","DOI":"10.1007\/978-1-4615-1567-8_6"},{"key":"19_CR4","first-page":"177","volume-title":"Principles of Knowledge Representation and Reasoning","author":"M. Denecker","year":"2002","unstructured":"Denecker, M., Marek, V., Truszczy\u0144sky, M.: Ultimate approximations in nonmonotonic knowledge representation systems. In: Principles of Knowledge Representation and Reasoning, pp. 177\u2013188. Morgan Kaufmann, San Francisco (2002)"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/3-540-45635-X_22","volume-title":"Logic Programming","author":"M. Denecker","year":"2001","unstructured":"Denecker, M., Pelov, N., Bruynooghe, M.: Ultimate well-founded and stable model semantics for logic programs with aggregates. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol.\u00a02237, pp. 212\u2013226. Springer, Heidelberg (2001)"},{"issue":"4","key":"19_CR6","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","volume":"2","author":"M. Fitting","year":"1985","unstructured":"Fitting, M.: A Kripke-Kleene semantics for logic programs. Journal of Logic Programming\u00a02(4), 295\u2013312 (1985)","journal-title":"Journal of Logic Programming"},{"issue":"1-2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0304-3975(00)00330-3","volume":"278","author":"M. Fitting","year":"2002","unstructured":"Fitting, M.: Fixpoint semantics for logic programming a survey. Theoretical Computer Science\u00a0278(1-2), 25\u201351 (2002)","journal-title":"Theoretical Computer Science"},{"key":"19_CR8","series-title":"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.\u00a02408, pp. 413\u2013451. Springer, Heidelberg (2002)"},{"key":"19_CR9","first-page":"1070","volume-title":"Logic Programming, Proc. of the 5th International Conference and Symposium","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R.A., Bowen, K.A. (eds.) Logic Programming, Proc. of the 5th International Conference and Symposium, pp. 1070\u20131080. MIT Press, Cambridge (1988)"},{"issue":"1-2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0304-3975(94)00153-A","volume":"146","author":"D.B. Kemp","year":"1995","unstructured":"Kemp, D.B., Srivastava, D., Stuckey, P.J.: Bottom-up evaluation and query optimization of well-founded models. Theoretical Computer Science\u00a0146(1-2), 145\u2013184 (1995)","journal-title":"Theoretical Computer Science"},{"key":"19_CR11","first-page":"387","volume-title":"Proc. of the Int. Logic Programming Symposium","author":"D.B. Kemp","year":"1991","unstructured":"Kemp, D.B., Stuckey, P.J.: Semantics of logic programs with aggregates. In: Proc. of the Int. Logic Programming Symposium, pp. 387\u2013401. MIT Press, Cambridge (1991)"},{"key":"19_CR12","unstructured":"Marek, V., Remmel, J.: On logic programs with cardinality constraints. In: 9th International Workshop on Non-Monotonic Reasoning, pp. 219\u2013228 (2002)"},{"key":"19_CR13","unstructured":"Mumick, S., Pirahesh, H., Ramakrishnan, R.: The magic of duplicates and aggregates. In: 16th Int. Conf. on Very Large Data Bases, pp. 264\u2013277 (1990)"},{"issue":"4","key":"19_CR14","doi-asserted-by":"crossref","first-page":"445","DOI":"10.3233\/FI-1990-13404","volume":"13","author":"T. Przymusinksi","year":"1990","unstructured":"Przymusinksi, T.: The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae\u00a013(4), 445\u2013464 (1990)","journal-title":"Fundamenta Informaticae"},{"issue":"1","key":"19_CR15","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1006\/jcss.1997.1453","volume":"54","author":"K.A. Ross","year":"1997","unstructured":"Ross, K.A., Sagiv, Y.: Monotonic aggregation in deductive databases. Journal of Computer and System Sciences\u00a054(1), 79\u201397 (1997)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1-2","key":"19_CR16","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":"19_CR17","first-page":"127","volume-title":"11th ACM Symposium on Principles of Database Systems","author":"A. Gelder Van","year":"1992","unstructured":"Van Gelder, A.: The well-founded semantics of aggregation. In: 11th ACM Symposium on Principles of Database Systems, pp. 127\u2013138. ACM Press, New York (1992)"}],"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-540-24609-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T10:16:39Z","timestamp":1637144199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24609-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540207214","9783540246091"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24609-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}