{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T04:09:20Z","timestamp":1768622960695,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":45,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540899815","type":"print"},{"value":"9783540899822","type":"electronic"}],"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_8","type":"book-chapter","created":{"date-parts":[[2008,12,14]],"date-time":"2008-12-14T22:09:15Z","timestamp":1229292555000},"page":"37-51","source":"Crossref","is-referenced-by-count":27,"title":["Twelve Definitions of a Stable Model"],"prefix":"10.1007","author":[{"given":"Vladimir","family":"Lifschitz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/B978-0-934613-40-8.50006-3","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"K. Apt","year":"1988","unstructured":"Apt, K., Blair, H., Walker, A.: Towards a theory of declarative knowledge. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 89\u2013148. Morgan Kaufmann, San Mateo (1988)"},{"key":"8_CR2","unstructured":"Balduccini, M., Gelfond, M.: Logic programs with consistency-restoring rules. In: Working Notes of the AAAI Spring Symposium on Logical Formalizations of Commonsense Reasoning (2003), \n                      \n                        http:\/\/www.krlab.cs.ttu.edu\/papers\/download\/bg03.pdf"},{"key":"8_CR3","unstructured":"Bidoit, N., Froidevaux, C.: Minimalism subsumes default logic and circumscription in stratified logic programming. In: Proc. LICS 1987, pp. 89\u201397 (1987)"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and Data Bases","author":"K. Clark","year":"1978","unstructured":"Clark, K.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293\u2013322. Plenum Press, New York (1978)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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: Semantics and complexity. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS, vol.\u00a03229. Springer, Heidelberg (2004)"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/BF03037172","volume":"9","author":"F. Fages","year":"1991","unstructured":"Fages, F.: A fixpoint semantics for general logic programs compared with the well\u2013supported and stable model semantics. New Generation Computing\u00a09, 425\u2013443 (1991)","journal-title":"New Generation Computing"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1017\/S1471068403001923","volume":"5","author":"P. Ferraris","year":"2005","unstructured":"Ferraris, P., Lifschitz, V.: Weight constraints as nested expressions. Theory and Practice of Logic Programming\u00a05, 45\u201374 (2005)","journal-title":"Theory and Practice of Logic Programming"},{"key":"8_CR8","unstructured":"Ferraris, P., Lee, J., Lifschitz, V.: A new perspective on stable models. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pp. 372\u2013379 (2007)"},{"key":"8_CR9","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":"8_CR10","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0049-237X(08)70050-8","volume-title":"Proceedings of the Eighth International Congress of Logic, Methodology and Philosophy of Science","author":"K. Fine","year":"1989","unstructured":"Fine, K.: The justification of negation as failure. In: Proceedings of the Eighth International Congress of Logic, Methodology and Philosophy of Science, pp. 263\u2013301. North Holland, Amsterdam (1989)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-72200-7_3","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. 3\u201317. Springer, Heidelberg (2007)"},{"key":"8_CR12","first-page":"1070","volume-title":"Proceedings of International Logic Programming Conference and Symposium","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Proceedings of International Logic Programming Conference and Symposium, pp. 1070\u20131080. MIT Press, Cambridge (1988)"},{"key":"8_CR13","unstructured":"Gelfond, M., Lifschitz, V.: Logic programs with classical negation. In: Warren, D., Szeredi, P. (eds.) Proceedings of International Conference on Logic Programming (ICLP), pp. 579\u2013597 (1990)"},{"key":"8_CR14","unstructured":"Gelfond, M.: On stratified autoepistemic theories. In: Proceedings of National Conference on Artificial Intelligence (AAAI), pp. 207\u2013211 (1987)"},{"key":"8_CR15","unstructured":"Heyting, A.: Die formalen Regeln der intuitionistischen Logik. In: Sitzungsberichte der Preussischen Akademie der Wissenschaften. Physikalisch-mathematische Klasse, pp. 42\u201356 (1930)"},{"key":"8_CR16","unstructured":"Lee, J., Lifschitz, V., Palla, R.: A reductive semantics for counting and choice in answer set programming. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 472\u2013479 (2008)"},{"key":"8_CR17","unstructured":"Lee, J.: A model-theoretic counterpart of loop formulas. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pp. 503\u2013508 (2005)"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1023\/A:1018978005636","volume":"25","author":"V. Lifschitz","year":"1999","unstructured":"Lifschitz, V., Tang, L.R., Turner, H.: Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence\u00a025, 369\u2013389 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1145\/383779.383783","volume":"2","author":"V. Lifschitz","year":"2001","unstructured":"Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transactions on Computational Logic\u00a02, 526\u2013541 (2001)","journal-title":"ACM Transactions on Computational Logic"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/B978-0-934613-40-8.50008-7","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"V. Lifschitz","year":"1988","unstructured":"Lifschitz, V.: On the declarative semantics of logic programs with negation. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 177\u2013192. Morgan Kaufmann, San Mateo (1988)"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0743-1066(96)00122-7","volume":"31","author":"F. Lin","year":"1997","unstructured":"Lin, F., Reiter, R.: Rules as actions: A situation calculus semantics for logic programs. Journal of Logic Programming\u00a031, 299\u2013330 (1997)","journal-title":"Journal of Logic Programming"},{"key":"8_CR22","unstructured":"Lin, F., Zhao, Y.: ASSAT: Computing answer sets of a logic program by SAT solvers. In: Proceedings of National Conference on Artificial Intelligence (AAAI), pp. 112\u2013117 (2002)"},{"key":"8_CR23","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.artint.2004.04.004","volume":"157","author":"F. Lin","year":"2004","unstructured":"Lin, F., Zhao, Y.: ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence\u00a0157, 115\u2013137 (2004), \n                      \n                        http:\/\/www.cs.ust.hk\/faculty\/flin\/papers\/assat-aij-revised.pdf","journal-title":"Artificial Intelligence"},{"key":"8_CR24","unstructured":"Lin, F., Zhou, Y.: From answer set logic programming to circumscription via logic of GK. In: Proceedings of International Joint Conference on Artificial Intelligence, IJCAI (2007)"},{"key":"8_CR25","unstructured":"Lin, F.: A Study of Nonmonotonic Reasoning. PhD thesis, Stanford University (1991)"},{"key":"8_CR26","unstructured":"Marek, V., Truszczy\u0144ski, M.: Stable semantics for logic programs and default theories. In: Proc. North American Conf.\u00a0on Logic Programming, pp. 243\u2013256 (1989)"},{"key":"8_CR27","first-page":"463","volume-title":"Machine Intelligence","author":"J. McCarthy","year":"1969","unstructured":"McCarthy, J., Hayes, P.: Some philosophical problems from the standpoint of artificial intelligence. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence, vol.\u00a04, pp. 463\u2013502. Edinburgh University Press, Edinburgh (1969)"},{"key":"8_CR28","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"J. McCarthy","year":"1980","unstructured":"McCarthy, J.: Circumscription\u2014a form of non-monotonic reasoning. Artificial Intelligence\u00a013, 27\u201339, 171\u2013172 (1980)","journal-title":"Artificial Intelligence"},{"issue":"3","key":"8_CR29","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0004-3702(86)90032-9","volume":"26","author":"J. McCarthy","year":"1986","unstructured":"McCarthy, J.: Applications of circumscription to formalizing common sense knowledge. Artificial Intelligence\u00a026(3), 89\u2013116 (1986)","journal-title":"Artificial Intelligence"},{"key":"8_CR30","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0004-3702(80)90012-0","volume":"13","author":"D. McDermott","year":"1980","unstructured":"McDermott, D., Doyle, J.: Nonmonotonic logic\u00a0I. Artificial Intelligence\u00a013, 41\u201372 (1980)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"8_CR31","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/322290.322293","volume":"29","author":"D. McDermott","year":"1982","unstructured":"McDermott, D.: Nonmonotonic logic\u00a0II: Nonmonotonic modal theories. Journal of ACM\u00a029(1), 33\u201357 (1982)","journal-title":"Journal of ACM"},{"issue":"1","key":"8_CR32","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0004-3702(85)90042-6","volume":"25","author":"R. Moore","year":"1985","unstructured":"Moore, R.: Semantical considerations on nonmonotonic logic. Artificial Intelligence\u00a025(1), 75\u201394 (1985)","journal-title":"Artificial Intelligence"},{"key":"8_CR33","doi-asserted-by":"publisher","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, Dordrecht (2000)"},{"key":"8_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/3-540-45329-6_31","volume-title":"Progress in Artificial Intelligence. Knowledge Extraction, Multi-agent Systems, Logic Programming, and Constraint Solving","author":"D. Pearce","year":"2001","unstructured":"Pearce, D., Tompits, H., Woltran, S.: Encodings for equilibrium logic and logic programs with nested expressions. In: Brazdil, P.B., Jorge, A.M. (eds.) EPIA 2001. LNCS, vol.\u00a02258, pp. 306\u2013320. Springer, Heidelberg (2001)"},{"key":"8_CR35","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BFb0023801","volume-title":"Non-Monotonic Extensions of Logic Programming","author":"D. Pearce","year":"1997","unstructured":"Pearce, D.: A new logical characterization of stable models and answer sets. In: Dix, J., Pereira, L., Przymusinski, T. (eds.) NMELP 1996. LNCS (LNAI), vol.\u00a01216, pp. 57\u201370. Springer, Heidelberg (1997)"},{"key":"8_CR36","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"Reiter, R.: A logic for default reasoning. Artificial Intelligence\u00a013, 81\u2013132 (1980)","journal-title":"Artificial Intelligence"},{"key":"8_CR37","unstructured":"Reiter, R.: Circumscription implies predicate completion (sometimes). In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pp. 418\u2013420 (1982)"},{"key":"8_CR38","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4074.001.0001","volume-title":"Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems","author":"R. Reiter","year":"2001","unstructured":"Reiter, R.: Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems. MIT Press, Cambridge (2001)"},{"key":"8_CR39","doi-asserted-by":"crossref","unstructured":"Sacc\u00e1, D., Zaniolo, C.: Stable models and non-determinism in logic programs with negation. In: Proceedings of ACM Symposium on Principles of Database Systems (PODS), pp. 205\u2013217 (1990)","DOI":"10.1145\/298514.298572"},{"key":"8_CR40","first-page":"320","volume-title":"Micro-PROLOG: Programming in Logic","author":"M. Emden van","year":"1984","unstructured":"van Emden, M., Clark, K.: The logic of two-person games. In: Micro-PROLOG: Programming in Logic, pp. 320\u2013340. Prentice-Hall, Englewood Cliffs (1984)"},{"issue":"4","key":"8_CR41","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"M. Emden van","year":"1976","unstructured":"van Emden, M., Kowalski, R.: The semantics of predicate logic as a programming language. Journal of ACM\u00a023(4), 733\u2013742 (1976)","journal-title":"Journal of ACM"},{"key":"8_CR42","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1145\/308386.308444","volume-title":"Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","author":"A. Gelder Van","year":"1988","unstructured":"Van Gelder, A., Ross, K.A., Schlipf, J.S.: Unfounded sets and well-founded semantics for general logic programs. In: Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Austin, Texas, March 21-23, 1988, pp. 221\u2013230. ACM Press, New York (1988)"},{"issue":"3","key":"8_CR43","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. Journal of ACM\u00a038(3), 620\u2013650 (1991)","journal-title":"Journal of ACM"},{"key":"8_CR44","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/B978-0-934613-40-8.50007-5","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"A. Gelder Van","year":"1988","unstructured":"Van Gelder, A.: Negation as failure using tight derivations for general logic programs. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 149\u2013176. Morgan Kaufmann, San Mateo (1988)"},{"key":"8_CR45","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0743-1066(93)90041-E","volume":"15","author":"M. Wallace","year":"1993","unstructured":"Wallace, M.: Tight, consistent and computable completions for unrestricted logic programs. Journal of Logic Programming\u00a015, 243\u2013273 (1993)","journal-title":"Journal of Logic Programming"}],"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_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T05:51:50Z","timestamp":1551678710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89982-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540899815","9783540899822"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89982-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}