{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:26:57Z","timestamp":1725575217331},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540207214"},{"type":"electronic","value":"9783540246091"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24609-1_7","type":"book-chapter","created":{"date-parts":[[2011,1,13]],"date-time":"2011-01-13T22:31:31Z","timestamp":1294957891000},"page":"47-60","source":"Crossref","is-referenced-by-count":9,"title":["A Logic of Non-monotone Inductive Definitions and Its Modularity Properties"],"prefix":"10.1007","author":[{"given":"Marc","family":"Denecker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eugenia","family":"Ternovska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","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. Elsevier, Amsterdam (1977)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Denecker, M., Bruynooghe, M., Marek, V.: Logic programming revisited: Logic programs as inductive definitions. ASM Transactions on Computational Logic (TOCL)\u00a04(2) (2001)","DOI":"10.1145\/383779.383789"},{"key":"7_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-49545-2_1","volume-title":"Logics in Artificial Intelligence","author":"M. Denecker","year":"1998","unstructured":"Denecker, M.: The well-founded semantics is the principle of inductive definitions. In: Dix, J., Fari\u00f1as del Cerro, L., Furbach, U. (eds.) JELIA 1998. LNCS (LNAI), vol.\u00a01489, pp. 1\u201316. Springer, Heidelberg (1998)"},{"key":"7_CR4","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., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, p. 703. Springer, Heidelberg (2000)"},{"issue":"1","key":"7_CR5","doi-asserted-by":"publisher","first-page":"65","DOI":"10.2178\/bsl\/1182353853","volume":"8","author":"A. Dawar","year":"2002","unstructured":"Dawar, A., Gurevich, Y.: Fixed point logics. The Bulletin of Symbolic Logic\u00a08(1), 65\u201388 (2002)","journal-title":"The Bulletin of Symbolic Logic"},{"key":"7_CR6","first-page":"127","volume-title":"Logic-Based AI","author":"M. Denecker","year":"2000","unstructured":"Denecker, M., Marek, V., Truszczynski, M.: Approximating operators, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning. In: Minker, J. (ed.) Logic-Based AI, pp. 127\u2013144. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"7_CR7","unstructured":"Denecker, M., Theseider Dupr\u00e8, D., Van Belleghem, K.: An inductive definition approach to ramifications. Link\u00f6ping Electronic Articles in Computer and Information Science\u00a03(7) (1998), http:\/\/www.ep.liu.se\/ea\/cis\/1998\/007\/"},{"key":"7_CR8","unstructured":"Fitting, M.: Fixpoint semantics for logic programming - a survey. Theoretical Computer Science (2003) (to appear)"},{"key":"7_CR9","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":"7_CR10","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":"7_CR11","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4074.001.0001","volume-title":"Knowledge in Action: Logical Foundations for Describing and Implementing Dynamical Systems","author":"R. Reiter","year":"2001","unstructured":"Reiter, R.: Knowledge in Action: Logical Foundations for Describing and Implementing Dynamical Systems. MIT Press, Cambridge (2001)"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1006\/jcss.1995.1053","volume":"51","author":"J. Schlipf","year":"1995","unstructured":"Schlipf, J.: The expressive powers of the logic programming semantics. Journal of Computer and System Sciences\u00a051, 64\u201386 (1995)","journal-title":"Journal of Computer and System Sciences"},{"key":"7_CR13","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math.\u00a05, 285\u2013309 (1955)","journal-title":"Pacific J. Math."},{"key":"7_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.: An alternating fixpoint of logic programs with negation. Journal of computer and system sciences\u00a047, 185\u2013221 (1993)","journal-title":"Journal of computer and system sciences"},{"issue":"3","key":"7_CR15","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0743-1066(99)00003-5","volume":"1","author":"S. Verbaeten","year":"2000","unstructured":"Verbaeten, S., Denecker, M., De Scheye, D.: Compositionality of normal open logic programs. journal of Logic Programming\u00a01(3), 151\u2013183 (2000)","journal-title":"journal of Logic Programming"},{"issue":"3","key":"7_CR16","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.A., Schlipf, J.S.: The well-founded semantics for general logic programs. Journal of Assoc. Comput. Mach.\u00a038(3), 620\u2013650 (1991)","journal-title":"Journal of Assoc. Comput. Mach."}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24609-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T16:52:53Z","timestamp":1559926373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24609-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540207214","9783540246091"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24609-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}