{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:22:03Z","timestamp":1760170923419},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319147253"},{"type":"electronic","value":"9783319147260"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-14726-0_9","type":"book-chapter","created":{"date-parts":[[2015,1,7]],"date-time":"2015-01-07T03:37:32Z","timestamp":1420601852000},"page":"125-140","source":"Crossref","is-referenced-by-count":7,"title":["Stability, Supportedness, Minimality and Kleene Answer Set Programs"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Doherty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Sza\u0142as","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-642-24206-9_17","volume-title":"Datalog Reloaded","author":"M. Alviano","year":"2011","unstructured":"Alviano, M., Faber, W., Leone, N., Perri, S., Pfeifer, G., Terracina, G.: The disjunctive datalog system DLV. In: de Moor, O., Gottlob, G., Furche, T., Sellers, A. (eds.) Datalog 2010. LNCS, vol.\u00a06702, pp. 282\u2013301. Springer, Heidelberg (2011)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Baral, C.: Knowledge Representation, Reasoning, and Declarative Problem Solving. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511543357"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-14309-0_8","volume-title":"A 25-Year Perspective on Logic Programming","author":"P. Bonatti","year":"2010","unstructured":"Bonatti, P., Calimeri, F., Leone, N., Ricca, F.: Answer set programming. In: Dovier, A., Pontelli, E. (eds.) GULP. LNCS, vol.\u00a06125, pp. 159\u2013182. Springer, Heidelberg (2010)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-540-74610-2_2","volume-title":"Logic Programming","author":"G. Brewka","year":"2007","unstructured":"Brewka, G.: Preferences, contexts and answer sets. In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007. LNCS, vol.\u00a04670, pp. 22\u201322. Springer, Heidelberg (2007)"},{"issue":"12","key":"9_CR5","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G. Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM\u00a054(12), 92\u2013103 (2011)","journal-title":"Commun. ACM"},{"key":"9_CR6","unstructured":"Brewka, G., Niemel\u00e4, I., Truszczynski, M.: Answer set optimization. In: Gottlob, G., Walsh, T. (eds.) Proc. 18th IJCAI, pp. 867\u2013872. Morgan Kaufmann (2003)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-642-04238-6_8","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"P. Cabalar","year":"2009","unstructured":"Cabalar, P., Pearce, D., Valverde, A.: A revised concept of safety for general answer set programs. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol.\u00a05753, pp. 58\u201370. Springer, Heidelberg (2009)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Denecker, M., Marek, V., Truszczynski, M.: Stable operators, well-founded fixpoints and applications in nnonmonotonic reasoning. In: Minker, J. (ed.) Logic-based Artificial Intelligence, pp. 127\u2013144. Kluwer Academic Pub. (2000)","DOI":"10.1007\/978-1-4615-1567-8_6"},{"key":"9_CR9","unstructured":"Eiter, T., Gottlob, G.: Complexity results for disjunctive logic programming and application to nonmonotonic logics. In: Miller, D. (ed.) Proceedings of the 1993 International Symposium on Logic Programming, pp. 266\u2013278 (1993)"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/BF03037172","volume":"9","author":"F. Fages","year":"1991","unstructured":"Fages, F.: A new fixpoint sematics for general logic programs compared with the well-founded and stable model semantics. New Generation Computing\u00a09, 425\u2013443 (1991)","journal-title":"New Generation Computing"},{"key":"9_CR11","first-page":"51","volume":"1","author":"F. Fages","year":"1994","unstructured":"Fages, F.: Consistency of Clark\u2019s completion and existence of stable models. Methods of Logic in Computer Science\u00a01, 51\u201360 (1994)","journal-title":"Methods of Logic in Computer Science"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Fenstad, J.E.: Situations, Language and Logic. D. Reidel Publishing Company (1987)","DOI":"10.1007\/978-94-009-1335-6"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-642-20832-4_5","volume-title":"Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning","author":"P. Ferraris","year":"2011","unstructured":"Ferraris, P., Lifschitz, V.: On the minimality of stable models. In: Balduccini, M., Son, T.C. (eds.) Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning. LNCS, vol.\u00a06565, pp. 64\u201373. Springer, Heidelberg (2011)"},{"issue":"4","key":"9_CR14","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. J. Logic Programming\u00a02(4), 295\u2013312 (1985)","journal-title":"J. Logic Programming"},{"issue":"2\/3&4","key":"9_CR15","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0743-1066(93)90031-B","volume":"17","author":"M. Fitting","year":"1993","unstructured":"Fitting, M.: The family of stable models. J. Logic Programming\u00a017(2\/3&4), 197\u2013225 (1993)","journal-title":"J. Logic Programming"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Gelfond, M., Kahl, Y.: Knowledge Representation, Reasoning, and the Design of Intelligent Agents - The Answer-Set Programming Approach. Cambridge University Press (2014)","DOI":"10.1017\/CBO9781139342124"},{"key":"9_CR17","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Proc. of Int\u2019l Logic Programming, pp. 1070\u20131080. MIT Press (1988)"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"150","DOI":"10.2307\/2267778","volume":"3","author":"S.C. Kleene","year":"1938","unstructured":"Kleene, S.C.: On a notation for ordinal numbers. Symbolic Logic\u00a03, 150\u2013155 (1938)","journal-title":"Symbolic Logic"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/978-3-642-15025-8_24","volume-title":"Fields of Logic and Computation","author":"V. Lifschitz","year":"2010","unstructured":"Lifschitz, V.: Thirteen definitions of a stable model. In: Blass, A., Dershowitz, N., Reisig, W. (eds.) Fields of Logic and Computation. LNCS, vol.\u00a06300, pp. 488\u2013503. Springer, Heidelberg (2010)"},{"issue":"4","key":"9_CR20","first-page":"395","volume":"6","author":"Z. Lonc","year":"2006","unstructured":"Lonc, Z., Truszczynski, M.: Computing minimal models, stable models and answer sets. TPLP\u00a06(4), 395\u2013449 (2006)","journal-title":"TPLP"},{"issue":"1-2","key":"9_CR21","first-page":"3","volume":"47","author":"D. Pearce","year":"2006","unstructured":"Pearce, D.: Equilibrium logic. Annals of Mathematics and AI\u00a047(1-2), 3\u201341 (2006)","journal-title":"Annals of Mathematics and AI"},{"issue":"3\/4","key":"9_CR22","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF03037171","volume":"9","author":"T. Przymusinski","year":"1991","unstructured":"Przymusinski, T.: Stable semantics for disjunctive programs. New Generation Comput.\u00a09(3\/4), 401\u2013424 (1991)","journal-title":"New Generation Comput."},{"issue":"3","key":"9_CR23","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(89)90106-0","volume":"65","author":"J.C. Shepherdson","year":"1989","unstructured":"Shepherdson, J.C.: A sound and complete semantics for a version of negation as failure. Theoretical Computer Science\u00a065(3), 343\u2013371 (1989)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14726-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T13:27:50Z","timestamp":1690810070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14726-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319147253","9783319147260"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14726-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}