{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T22:45:22Z","timestamp":1774046722901,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540721994","type":"print"},{"value":"9783540722007","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72200-7_9","type":"book-chapter","created":{"date-parts":[[2007,6,5]],"date-time":"2007-06-05T16:54:47Z","timestamp":1181062487000},"page":"84-96","source":"Crossref","is-referenced-by-count":16,"title":["Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions"],"prefix":"10.1007","author":[{"given":"Marc","family":"Denecker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joost","family":"Vennekens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1016\/S0049-237X(08)71120-0","volume-title":"Handbook of Mathematical Logic","author":"P. Aczel","year":"1977","unstructured":"Aczel, P.: An introduction to inductive definitions. In: Barwise, J. (ed.) Handbook of Mathematical Logic, pp. 739\u2013782. North-Holland, Amsterdam (1977)"},{"key":"9_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/3-540-44957-4_47","volume-title":"Computational Logic - CL 2000","author":"M. Denecker","year":"2000","unstructured":"Denecker, M.: Extending classical logic with inductive definitions. In: Palamidessi, C., et al. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 703\u2013717. Springer, Heidelberg (2000)"},{"issue":"4","key":"9_CR3","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1145\/383779.383789","volume":"2","author":"M. Denecker","year":"2001","unstructured":"Denecker, M., Bruynooghe, M., Marek, V.: Logic programming revisited: Logic programs as inductive definitions. ACM Transactions on Computational Logic\u00a02(4), 623\u2013654 (2001)","journal-title":"ACM Transactions on Computational Logic"},{"key":"9_CR4","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.: Approximating operators, 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)"},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0004-3702(02)00293-X","volume":"143","author":"M. Denecker","year":"2003","unstructured":"Denecker, M., Marek, V., Truszczy\u0144ski, M.: Uniform semantic treatment of default and autoepistemic logics. Artificial Intelligence\u00a0143(1), 79\u2013122 (2003)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"9_CR6","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.ic.2004.02.004","volume":"192","author":"M. Denecker","year":"2004","unstructured":"Denecker, M., Marek, V., Truszczy\u0144ski, M.: Ultimate approximation and its application in nonmonotonic knowledge representation systems. Information and Computation\u00a0192(1), 84\u2013121 (2004)","journal-title":"Information and Computation"},{"key":"9_CR7","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Denecker","year":"2003","unstructured":"Denecker, M., Ternovska, E.: A logic of non-monotone inductive definitions and its modularity properties. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol.\u00a02923, Springer, Heidelberg (2003)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Denecker, M., Ternovska, E.: A logic of non-monotone inductive definitions. Transactions On Computational Logic (TOCL) (2007)","DOI":"10.1145\/1342991.1342998"},{"key":"9_CR9","volume-title":"Finite Model Theory","author":"H.-D. Ebbinghaus","year":"1999","unstructured":"Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. Springer, Heidelberg (1999)"},{"key":"9_CR10","first-page":"303","volume-title":"Intuitionism and Proof theory","author":"S. Feferman","year":"1970","unstructured":"Feferman, S.: Formal theories for transfinite iterations of generalised inductive definitions and some subsystems of analysis. In: Kino, A., Myhill, J., Vesley, R.E. (eds.) Intuitionism and Proof theory, pp. 303\u2013326. North-Holland, Amsterdam (1970)"},{"issue":"4","key":"9_CR11","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. Journal of Logic Programming\u00a02(4), 295\u2013312 (1985)","journal-title":"Journal of Logic Programming"},{"issue":"2-4","key":"9_CR12","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. Journal of Logic Programming\u00a017(2-4), 197\u2013225 (1993)","journal-title":"Journal of Logic Programming"},{"issue":"5","key":"9_CR13","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1017\/S1471068401001053","volume":"1","author":"Z. Lonc","year":"2001","unstructured":"Lonc, Z., Truszczy\u0144ski, M.: On the problem of computing the well-founded semantics. Theory and practice of Logic Programming\u00a01(5), 591\u2013609 (2001)","journal-title":"Theory and practice of Logic Programming"},{"key":"9_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/11591191_39","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M. Mari\u00ebn","year":"2005","unstructured":"Mari\u00ebn, M., et al.: Satisfiability checking for PC(ID). In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol.\u00a03835, pp. 565\u2013579. Springer, Heidelberg (2005)"},{"key":"9_CR15","first-page":"430","volume-title":"AAAI\u201905","author":"D. Mitchell","year":"2005","unstructured":"Mitchell, D., Ternovska, E.: A framework for representing and solving np search problems. In: AAAI\u201905, pp. 430\u2013435. AAAI Press, Menlo Park (2005)"},{"key":"9_CR16","volume-title":"Elementary Induction on Abstract Structures","author":"Y.N. Moschovakis","year":"1974","unstructured":"Moschovakis, Y.N.: Elementary Induction on Abstract Structures. North-Holland, Amsterdam (1974)"},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"39","DOI":"10.4064\/fm-82-1-39-83","volume":"82","author":"Y.N. Moschovakis","year":"1974","unstructured":"Moschovakis, Y.N.: On non-monotone inductive definability. Fundamenta Mathematica\u00a082, 39\u201383 (1974)","journal-title":"Fundamenta Mathematica"},{"key":"9_CR18","unstructured":"Niemel\u00e4, I., Simons, P., Syrj\u00e4nen, T.: Smodels: a system for answer set programming. In: Proceedings of the 8th International Workshop on Non-Monotonic Reasoning, Breckenridge, Colorado, USA, cs.AI\/0003033 (April 2000)"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"197","DOI":"10.2307\/2371809","volume":"65","author":"E. Post","year":"1943","unstructured":"Post, E.: Formal reduction of the general combinatorial decision problem. American Journal of Mathematics\u00a065, 197\u2013215 (1943)","journal-title":"American Journal of Mathematics"},{"key":"9_CR20","first-page":"97","volume-title":"Infinitistic Methods (Proc. 1959 Symposium on Foundation of Mathematis in Warsaw)","author":"C. Spector","year":"1961","unstructured":"Spector, C.: Inductively defined sets of natural numbers. In: Infinitistic Methods (Proc. 1959 Symposium on Foundation of Mathematis in Warsaw), pp. 97\u2013102. Pergamon Press, Oxford (1961)"},{"key":"9_CR21","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"Tarski, A.: Lattice-theoretic fixpoint theorem and its applications. Pacific journal of Mathematics\u00a05, 285\u2013309 (1955)","journal-title":"Pacific journal of Mathematics"},{"issue":"17","key":"9_CR22","doi-asserted-by":"publisher","first-page":"481","DOI":"10.2307\/2024549","volume":"63","author":"B.C. Fraassen van","year":"1966","unstructured":"van Fraassen, B.C.: Singular Terms, truth-Value Gaps, and Free Logic. The journal of Philosophy\u00a063(17), 481\u2013495 (1966)","journal-title":"The journal of Philosophy"},{"issue":"3","key":"9_CR23","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Gelder Van","year":"1991","unstructured":"Van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. Journal of the ACM\u00a038(3), 620\u2013650 (1991)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72200-7_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:29:40Z","timestamp":1605763780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72200-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540721994","9783540722007"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72200-7_9","relation":{},"subject":[]}}