{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T19:35:45Z","timestamp":1774380945534,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2006,9,20]],"date-time":"2006-09-20T00:00:00Z","timestamp":1158710400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2006,11,9]]},"DOI":"10.1007\/s10472-006-9025-2","type":"journal-article","created":{"date-parts":[[2006,9,19]],"date-time":"2006-09-19T05:19:25Z","timestamp":1158643165000},"page":"79-101","source":"Crossref","is-referenced-by-count":28,"title":["A generalization of the Lin-Zhao theorem"],"prefix":"10.1007","volume":"47","author":[{"given":"Paolo","family":"Ferraris","sequence":"first","affiliation":[]},{"given":"Joohyung","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Vladimir","family":"Lifschitz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,9,20]]},"reference":[{"key":"9025_CR1","doi-asserted-by":"crossref","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, New York (1978)"},{"key":"9025_CR2","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1017\/S1471068403001765","volume":"3","author":"E. Erdem","year":"2003","unstructured":"Erdem, E., Lifschitz, V.: Tight logic programs. Theory and Pract. Log. Prog. 3, 499\u2013518 (2003)","journal-title":"Theory and Pract. Log. Prog."},{"key":"9025_CR3","first-page":"51","volume":"1","author":"F. Fages","year":"1994","unstructured":"Fages, F.: Consistency of Clark\u2019s completion and existence of stable models. J. Meth. Log. Comput. Sci. 1, 51\u201360 (1994)","journal-title":"J. Meth. Log. Comput. Sci."},{"key":"9025_CR4","first-page":"615","volume-title":"We Will Show Them! Essays in Honour of Dov Gabbay, vol. 1","author":"P. Ferraris","year":"2005","unstructured":"Ferraris P., Lifschitz V.: Mathematical foundations of answer set programming. In: We Will Show Them! Essays in Honour of Dov Gabbay, vol. 1, pp. 615\u2013665. King\u2019s College, London (2005)"},{"key":"9025_CR5","doi-asserted-by":"crossref","unstructured":"Ferraris P.: Answer sets for propositional theories. In: Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), Cosenza, Italy, 119\u2013131 (2005)","DOI":"10.1007\/11546207_10"},{"key":"9025_CR6","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, MIT, Cambridge, Massachusetts, 1070\u20131080 (1988)"},{"key":"9025_CR7","unstructured":"Gelfond M., Lifschitz V.: Logic programs with classical negation. In: Warren D., Szeredi P. (eds.) Proceedings of International Conference on Logic Programming (ICLP), Jerusalem, Israel, 579\u2013597, June (1990)"},{"key":"9025_CR8","doi-asserted-by":"crossref","unstructured":"Lee J., Lifschitz V.: Loop formulas for disjunctive logic programs. In: Proceedings of International Conference on Logic Programming (ICLP), Mumbai, India, 451\u2013465, December (2003)","DOI":"10.1007\/978-3-540-24599-5_31"},{"key":"9025_CR9","unstructured":"Lee J.: A model-theoretic counterpart of loop formulas. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), Edinburgh, Scotland, 503\u2013508 (2005)"},{"issue":"2","key":"9025_CR10","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1006\/inco.1997.2630","volume":"135","author":"N. Leone","year":"1997","unstructured":"Leone, N., Rullo, P., Scarcello, F.: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation. Inf. comput. 135(2), 69\u2013112 (1997)","journal-title":"Inf. comput."},{"key":"9025_CR11","doi-asserted-by":"crossref","unstructured":"Lierler Y.: Cmodels: SAT-based disjunctive answer set solver. In: Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), Diamante, Italy, 447\u2013452 (2005)","DOI":"10.1007\/11546207_44"},{"issue":"2","key":"9025_CR12","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/1131313.1131316","volume":"7","author":"V. Lifschitz","year":"2006","unstructured":"Lifschitz V., Razborov A.: Why are there so many loop formulas? ACM Trans. Comput. Log. 7(2), 261\u2013268 (2006)","journal-title":"ACM Trans. Comput. Log."},{"key":"9025_CR13","doi-asserted-by":"crossref","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. Ann. Math. Artif. Intell. 25, 369\u2013389 (1999)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9025_CR14","first-page":"298","volume-title":"The Handbook of Logic in AI and Logic Programming, vol.3","author":"V. Lifschitz","year":"1999","unstructured":"Lifschitz V.: Circumscription. In: Gabbay D.M., Hogger C.J., Robinson J.A., (eds.) The Handbook of Logic in AI and Logic Programming, vol.3 pp. 298\u2013352. Oxford University Press, UK (1994)"},{"key":"9025_CR15","doi-asserted-by":"crossref","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. Artif. Intell. 157, 115\u2013137 (2004)","journal-title":"Artif. Intell."},{"key":"9025_CR16","doi-asserted-by":"crossref","unstructured":"McCarthy J.: Circumscription\u2014a form of non-monotonic reasoning. Artif. intell. 13, 27\u201339, 171\u2013172 (1980)","DOI":"10.1016\/0004-3702(80)90011-9"},{"issue":"3","key":"9025_CR17","doi-asserted-by":"crossref","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. Artif. Intell. 26(3), 89\u2013116 (1986)","journal-title":"Artif. Intell."},{"key":"9025_CR18","volume-title":"Formalizing Common Sense: Papers by John McCarthy","author":"J. McCarthy","year":"1990","unstructured":"McCarthy, J.: Formalizing Common Sense: Papers by John McCarthy. Ablex, Norwood New Jersey (1990)"},{"key":"9025_CR19","doi-asserted-by":"crossref","unstructured":"Pearce D., Tompits H., Woltran S.: Encodings for equilibrium logic and logic programs with nested expressions. In: Proceedings of Portuguese Conference on Artificial Intelligence (EPIA), Porto, Portugal, 306\u2013320 (2001)","DOI":"10.1007\/3-540-45329-6_31"},{"key":"9025_CR20","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BFb0023801","volume-title":"Non-Monotonic Extensions of Logic Programming (Lecture Notes in Artificial Intelligence 1216)","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.) Non-Monotonic Extensions of Logic Programming (Lecture Notes in Artificial Intelligence 1216), pp. 57\u201370. Springer, Berlin Heidelberg New York (1997)"},{"key":"9025_CR21","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), Nashville, Tennesse 205\u2013217 (1990)","DOI":"10.1145\/298514.298572"},{"key":"9025_CR22","volume-title":"Basic Proof Theory","author":"A.S. Troelstra","year":"1996","unstructured":"Troelstra A.S., Schwichtenberg H.: Basic Proof Theory. Cambridge University Press, UK (1996)"},{"issue":"3","key":"9025_CR23","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Gelder Van","year":"1991","unstructured":"Van\u00a0Gelder, A., Ross, K., Schlipf, J.: The well-founded semantics for general logic programs. J. ACM 38(3), 620\u2013650 (1991)","journal-title":"J. ACM"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-006-9025-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-006-9025-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-006-9025-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:51:49Z","timestamp":1559137909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-006-9025-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9,20]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2006,11,9]]}},"alternative-id":["9025"],"URL":"https:\/\/doi.org\/10.1007\/s10472-006-9025-2","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,9,20]]}}}