{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:27:17Z","timestamp":1725575237834},"publisher-location":"Berlin, Heidelberg","reference-count":15,"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_15","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T03:31:31Z","timestamp":1294975891000},"page":"154-166","source":"Crossref","is-referenced-by-count":5,"title":["Logic Programs With Monotone Cardinality Atoms"],"prefix":"10.1007","author":[{"given":"Victor W.","family":"Marek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilkka","family":"Niemel\u00e4","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miros\u0142aw","family":"Truszczy\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Babovich, Y., Lifschitz, V.: Cmodels (2002), http:\/\/www.cs.utexas.edu\/users\/tag\/cmodels.html"},{"key":"15_CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/978-1-4615-1567-8_6","volume-title":"Logic-Based Artificial Intelligence","author":"M. Denecker","year":"2000","unstructured":"Denecker, M., Marek, V., Truszczy\u0144ski, M.: Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 127\u2013144. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"15_CR3","first-page":"177","volume-title":"Principles of Knowledge Representation and Reasoning, Proceedings of the Eighth International Conference (KR 2002)","author":"M. Denecker","year":"2002","unstructured":"Denecker, M., Marek, V., Truszczy\u0144ski, M.: Ultimate approximations in nonmonotonic knowledge representation systems. In: Principles of Knowledge Representation and Reasoning, Proceedings of the Eighth International Conference (KR 2002), pp. 177\u2013188. Morgan Kaufmann Publishers, San Francisco (2002)"},{"key":"15_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/3-540-45422-5_11","volume-title":"KI 2001: Advances in Artificial Intelligence","author":"D. East","year":"2001","unstructured":"East, D., Truszczy\u0144ski, M.: Propositional satisfiability in answer-set programming. In: Baader, F., Brewka, G., Eiter, T. (eds.) KI 2001. LNCS (LNAI), vol.\u00a02174, pp. 138\u2013153. Springer, Heidelberg (2001)"},{"issue":"4-5","key":"15_CR5","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1017\/S1471068403001765","volume":"3","author":"E. Erdem","year":"2003","unstructured":"Erdem, E., Lifschitz, V.: Tight logic programs. Theory and Practice of Logic Programming\u00a03(4-5), 499\u2013518 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"key":"15_CR6","first-page":"51","volume":"1","author":"F. Fages","year":"1994","unstructured":"Fages, F.: Consistency of Clark\u2019s completion and existence of stable models. Journal of Methods of Logic in Computer Science\u00a01, 51\u201360 (1994)","journal-title":"Journal of Methods of Logic in Computer Science"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0304-3975(00)00330-3","volume":"278","author":"M.C. Fitting","year":"2002","unstructured":"Fitting, M.C.: Fixpoint semantics for logic programming \u2013 a survey. Theoretical Computer Science\u00a0278, 25\u201351 (2002)","journal-title":"Theoretical Computer Science"},{"key":"15_CR8","first-page":"1070","volume-title":"Proceedings of the 5th International Conference on Logic Programming","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The stable semantics for logic programs. In: Kowalski, R., Bowen, K. (eds.) Proceedings of the 5th International Conference on Logic Programming, pp. 1070\u20131080. MIT Press, Cambridge (1988)"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-540-45193-8_34","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"L. Liu","year":"2003","unstructured":"Liu, L., Truszczy\u0144ski, M.: Local-search techniques in propositional logic extended with cardinality atoms. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 495\u2013509. Springer, Heidelberg (2003)"},{"key":"15_CR10","volume-title":"Proceedings of JICSLP 1996","author":"I. Niemel\u00e4","year":"1996","unstructured":"Niemel\u00e4, I., Simons, P.: Efficient implementation of the well-founded and stable model semantics. In: Proceedings of JICSLP 1996. MIT Press, Cambridge (1996)"},{"key":"15_CR11","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/978-1-4615-1567-8_21","volume-title":"Logic-Based Artificial Intelligence","author":"I. 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)"},{"key":"15_CR12","series-title":"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.\u00a01730, pp. 317\u2013331. Springer, Heidelberg (1999)"},{"issue":"4","key":"15_CR13","doi-asserted-by":"crossref","first-page":"445","DOI":"10.3233\/FI-1990-13404","volume":"13","author":"T.C. Przymusinski","year":"1990","unstructured":"Przymusinski, T.C.: The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae\u00a013(4), 445\u2013464 (1990)","journal-title":"Fundamenta Informaticae"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF00881915","volume":"13","author":"C. Sakama","year":"1984","unstructured":"Sakama, C., Inoue, K.: An alternative approach to the semantics of disjunctive logic programs and deductive databases. Journal of Automated Reasoning\u00a013, 145\u2013172 (1984)","journal-title":"Journal of Automated Reasoning"},{"key":"15_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, 181\u2013234 (2002)","journal-title":"Artificial Intelligence"}],"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_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T10:16:45Z","timestamp":1637144205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24609-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540207214","9783540246091"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24609-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}