{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:44:07Z","timestamp":1794336247799,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540285380","type":"print"},{"value":"9783540318279","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11546207_6","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T10:41:23Z","timestamp":1127817683000},"page":"66-78","source":"Crossref","is-referenced-by-count":0,"title":["Approximating Answer Sets of Unitary Lifschitz-Woo Programs"],"prefix":"10.1007","author":[{"given":"Victor W.","family":"Marek","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Inna","family":"Pivkina","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Miros\u0142aw","family":"Truszczy\u0144ski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","first-page":"171","DOI":"10.7551\/mitpress\/4307.003.0016","volume-title":"Logic programming and non-monotonic reasoning","author":"A. Bondarenko","year":"1993","unstructured":"Bondarenko, A., Toni, F., Kowalski, R.A.: An assumption-based framework for non-monotonic reasoning. In: Nerode, A., Pereira, L. (eds.) Logic programming and non-monotonic reasoning, Lisbon, pp. 171\u2013189. MIT Press, Cambridge (1993)"},{"key":"6_CR2","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: Proceedings of the 5th International Conference on Logic Programming, pp. 1070\u20131080. MIT Press, Cambridge (1988)"},{"key":"6_CR3","doi-asserted-by":"publisher","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 Generation Computing\u00a09, 365\u2013385 (1991)","journal-title":"New Generation Computing"},{"key":"6_CR4","first-page":"69","volume-title":"Principles of Knowledge Representation","author":"V. Lifschitz","year":"1996","unstructured":"Lifschitz, V.: Foundations of logic programming. In: Principles of Knowledge Representation, pp. 69\u2013127. CSLI Publications, Stanford (1996)"},{"key":"6_CR5","first-page":"603","volume-title":"Proceedings of the 3rd international conference on principles of knowledge representation and reasoning, KR 1992","author":"V. Lifschitz","year":"1992","unstructured":"Lifschitz, V., Woo, T.Y.C.: Answer sets in general nonmonotonic reasoning. In: Proceedings of the 3rd international conference on principles of knowledge representation and reasoning, KR 1992, pp. 603\u2013614. Morgan Kaufmann, San Mateo (1992)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/10703163_6","volume-title":"Computer Science Logic","author":"V.W. Marek","year":"1999","unstructured":"Marek, V.W., Pivkina, I., Truszczy\u0144ski, M.: Revision programming = logic programming + integrity constraints. In: Gottlob, G., Grandjean, E., Seyr, K. (eds.) CSL 1998. LNCS, vol.\u00a01584, pp. 73\u201389. Springer, Heidelberg (1999)"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0004-3702(02)00184-4","volume":"138","author":"V.W. Marek","year":"2002","unstructured":"Marek, V.W., Pivkina, I., Truszczy\u0144ski, M.: Annotated revision programs. Artificial Intelligence Journal\u00a0138, 149\u2013180 (2002)","journal-title":"Artificial Intelligence Journal"},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0304-3975(97)00092-3","volume":"190","author":"W. Marek","year":"1998","unstructured":"Marek, W., Truszczy\u0144ski, M.: Revision programming. Theoretical Computer Science\u00a0190(2), 241\u2013277 (1998)","journal-title":"Theoretical Computer Science"},{"key":"6_CR9","unstructured":"Pivkina, I.: Revision programming: a knowledge representation formalism. PhD dissertation, University of Kentucky (2001)"},{"key":"6_CR10","unstructured":"Pivkina, I.: Defining well-founded semantics for revision programming Technical Report NMSU-CS-2005-001, New Mexico State University, Computer Science Department (2005)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/3-540-59487-6_12","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T.C. Przymusi\u0144ski","year":"1995","unstructured":"Przymusi\u0144ski, T.C., Turner, H.: Update by means of inference rules. In: Marek, V.W., Truszczy\u0144ski, M., Nerode, A. (eds.) LPNMR 1995. LNCS, vol.\u00a0928, pp. 156\u2013174. Springer, Heidelberg (1995)"},{"key":"6_CR12","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"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1109\/69.390244","volume":"7","author":"V.S. Subrahmanian","year":"1995","unstructured":"Subrahmanian, V.S., Nau, D., Vago, C.: WFS + branch bound = stable models. IEEE Transactions on Knowledge and Data Engineering\u00a07, 362\u2013377 (1995)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"6_CR14","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0022-0000(93)90024-Q","volume":"47","author":"A. Gelder Van","year":"1993","unstructured":"Van Gelder, A.: The alternating fixpoint of logic programs with negation. Journal of Computer and System Sciences\u00a047(1), 185\u2013221 (1993)","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Van Gelder, A., Ross, K.A., Schlipf, J.S.: Unfounded sets and well-founded semantics for general logic programs. In: ACM Symposium on Principles of Database Systems, pp. 221\u2013230 (1988)","DOI":"10.1145\/308386.308444"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11546207_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T05:34:11Z","timestamp":1706592851000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11546207_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540285380","9783540318279"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11546207_6","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11546207","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}