{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:06:33Z","timestamp":1742936793397,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031637346"},{"type":"electronic","value":"9783031637353"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-63735-3_13","type":"book-chapter","created":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T21:02:07Z","timestamp":1721682127000},"page":"218-235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards a\u00a0Unifying View on\u00a0Monotone Constructive Definitions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0700-7099","authenticated-orcid":false,"given":"Linde","family":"Vanbesien","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2914-787X","authenticated-orcid":false,"given":"Samuele","family":"Pollaci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3460-4251","authenticated-orcid":false,"given":"Bart","family":"Bogaerts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0422-7339","authenticated-orcid":false,"given":"Marc","family":"Denecker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,23]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Jung, A.: Domain theory. In: Handbook of Logic in Computer Science, vol. 3, pp. 1\u2013168. Oxford University Press, Inc., New York (1994). http:\/\/dl.acm.org\/citation.cfm?id=218742.218744","DOI":"10.1093\/oso\/9780198537625.003.0001"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Aczel, P.: An introduction to inductive definitions. In: Studies in Logic and the Foundations of Mathematics, vol.\u00a090, pp. 739\u2013782. Elsevier (1977)","DOI":"10.1016\/S0049-237X(08)71120-0"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Aczel, P.: The type theoretic interpretation of constructive set theory: inductive definitions. In: Studies in Logic and the Foundations of Mathematics, vol.\u00a0114, pp. 17\u201349. Elsevier (1986)","DOI":"10.1016\/S0049-237X(09)70683-4"},{"key":"13_CR4","unstructured":"Aziz, R.A.: Bound founded answer set programming. CoRR abs\/1405.3367 (2014). http:\/\/arxiv.org\/abs\/1405.3367"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Bogaerts, B., Vennekens, J., Denecker, M.: Safe inductions and their applications in knowledge representation. Artif. Intell. 259, 167\u2013185 (2018). https:\/\/doi.org\/10.1016\/j.artint.2018.03.008. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S000437021830122X","DOI":"10.1016\/j.artint.2018.03.008"},{"key":"13_CR6","unstructured":"Brouwer, L.E.J.: Over de grondslagen der wiskunde. Maas & van Suchtelen (1907)"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Buchholz, W., Feferman, S., Pohlers, W., Sieg, W.: Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-Theoretical Studies. Lecture Notes in Mathematics, vol.\u00a0897. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/BFb0091894","DOI":"10.1007\/BFb0091894"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-030-19570-0_34","volume-title":"Logics in Artificial Intelligence","author":"P Cabalar","year":"2019","unstructured":"Cabalar, P., Fandinno, J., Schaub, T., Schellhorn, S.: Lower bound founded logic of here-and-there. In: Calimeri, F., Leone, N., Manna, M. (eds.) JELIA 2019. LNCS (LNAI), vol. 11468, pp. 509\u2013525. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19570-0_34"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"De Cat, B., Bogaerts, B., Bruynooghe, M., Janssens, G., Denecker, M.: Predicate logic as a modeling language: the IDP system. In: Declarative Logic Programming: Theory, Systems, and Applications, pp. 279\u2013323 (2018). https:\/\/doi.org\/10.1145\/3191315.3191321","DOI":"10.1145\/3191315.3191321"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/3-540-44957-4_47","volume-title":"Computational Logic \u2014 CL 2000","author":"M Denecker","year":"2000","unstructured":"Denecker, M.: Extending classical logic with inductive definitions. In: Lloyd, J., et al. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 703\u2013717. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44957-4_47"},{"issue":"4","key":"13_CR11","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 Trans. Comput. Log. 2(4), 623\u2013654 (2001)","journal-title":"ACM Trans. Comput. Log."},{"key":"13_CR12","series-title":"The Springer International Series in Engineering and Computer Science","doi-asserted-by":"publisher","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.: Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning. In: Minker, J. (ed.) Logic-Based Artificial Intelligence. The Springer International Series in Engineering and Computer Science, vol. 597, pp. 127\u2013144. Springer, Boston (2000). https:\/\/doi.org\/10.1007\/978-1-4615-1567-8_6"},{"issue":"5\u20136","key":"13_CR13","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.artint.2007.02.002","volume":"171","author":"M Denecker","year":"2007","unstructured":"Denecker, M., Ternovska, E.: Inductive situation calculus. Artif. Intell. 171(5\u20136), 332\u2013360 (2007)","journal-title":"Artif. Intell."},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Denecker, M., Ternovska, E.: A logic of nonmonotone inductive definitions. ACM Trans. Comput. Log. 9(2), 14:1\u201314:52 (2008). https:\/\/doi.org\/10.1145\/1342991.1342998","DOI":"10.1145\/1342991.1342998"},{"key":"13_CR15","unstructured":"Denecker, M., Vennekens, J.: The well-founded semantics is the principle of inductive definition, revisited. In: Baral, C., De Giacomo, G., Eiter, T. (eds.) KR, pp. 1\u201310. AAAI Press (2014). http:\/\/www.aaai.org\/ocs\/index.php\/KR\/KR14\/paper\/view\/7957"},{"key":"13_CR16","unstructured":"Doets, K., Eijck, J.: The Haskell Road to Logic, Maths and Programming. College Publications (2004)"},{"key":"13_CR17","unstructured":"Downen, P., Ariola, Z.M.: Classical (co)recursion: programming. CoRR abs\/2103.06913 (2021). https:\/\/arxiv.org\/abs\/2103.06913"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Feferman, S.: Formal theories for transfinite iterations of generalised inductive definitions and some subsystems of analysis. In: Kino, A., Myhill, J., Vesley, R. (eds.) Intuitionism and Proof Theory, pp. 303\u2013326. North Holland (1970)","DOI":"10.1016\/S0049-237X(08)70761-4"},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Hudak, P.: Conception, evolution, and application of functional programming languages. ACM Comput. Surv. 21(3), 359\u2013411 (1989). https:\/\/doi.org\/10.1145\/72551.72554","DOI":"10.1145\/72551.72554"},{"key":"13_CR20","unstructured":"Kemp, D.B., Stuckey, P.J.: Semantics of logic programs with aggregates. In: Saraswat, V.A., Ueda, K. (eds.) ISLP, pp. 387\u2013401. MIT Press (1991)"},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"41","DOI":"10.2307\/2371894","volume":"66","author":"SC Kleene","year":"1944","unstructured":"Kleene, S.C.: On the forms of the predicates in the theory of constructive ordinals. Am. J. Math. 66, 41\u201358 (1944)","journal-title":"Am. J. Math."},{"issue":"7","key":"13_CR22","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1017\/S0960129515000493","volume":"27","author":"D Kozen","year":"2017","unstructured":"Kozen, D., Silva, A.: Practical coinduction. Math. Struct. Comput. Sci. 27(7), 1132\u20131152 (2017)","journal-title":"Math. Struct. Comput. Sci."},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Martin-L\u00f6f, P.: Hauptsatz for the intuitionistic theory of iterated inductive definitions. In: Fenstad, J. (ed.) Second Scandinavian Logic Symposium, pp. 179\u2013216 (1971)","DOI":"10.1016\/S0049-237X(08)70847-4"},{"key":"13_CR24","volume-title":"Elementary Induction on Abstract Structures","author":"YN Moschovakis","year":"1974","unstructured":"Moschovakis, Y.N.: Elementary Induction on Abstract Structures. North-Holland Publishing Company, Amsterdam; New York (1974)"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Paulson, L.C.: A fixedpoint approach to (co) inductive and (co) datatype definitions. In: Proof, Language, and Interaction, pp. 187\u2013212 (2000)","DOI":"10.7551\/mitpress\/5641.003.0013"},{"key":"13_CR26","volume-title":"Thinking Recursively","author":"ES Roberts","year":"1986","unstructured":"Roberts, E.S.: Thinking Recursively. Wiley, Hoboken (1986)"},{"key":"13_CR27","doi-asserted-by":"publisher","DOI":"10.1201\/9781315120850","volume-title":"Introduction to Recursive Programming","author":"M Rubio-Sanchez","year":"2017","unstructured":"Rubio-Sanchez, M.: Introduction to Recursive Programming. CRC Press, Boca Raton (2017)"},{"key":"13_CR28","doi-asserted-by":"publisher","unstructured":"Rusu, V., Nowak, D.: Defining corecursive functions in Coq using approximations. In: Ali, K., Vitek, J. (eds.) 36th European Conference on Object-Oriented Programming, ECOOP 2022, 6\u201310 June 2022, Berlin, Germany. LIPIcs, vol.\u00a0222, pp. 12:1\u201312:24. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ECOOP.2022.12","DOI":"10.4230\/LIPIcs.ECOOP.2022.12"},{"key":"13_CR29","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/BFb0079432","volume-title":"International Summer Institute and Logic Colloquium","author":"D Scott","year":"1975","unstructured":"Scott, D.: Data types as lattices. In: M\u00fcller, G.H., Oberschelp, A., Potthoff, K. (eds.) International Summer Institute and Logic Colloquium. Lecture Notes in Mathematics, vol. 499, pp. 579\u2013651. Springer, Heidelberg (1975). https:\/\/doi.org\/10.1007\/BFb0079432"},{"key":"13_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/11799573_25","volume-title":"Logic Programming","author":"L Simon","year":"2006","unstructured":"Simon, L., Mallya, A., Bansal, A., Gupta, G.: Coinductive logic programming. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol. 4079, pp. 330\u2013345. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11799573_25"},{"issue":"4","key":"13_CR31","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1137\/0211062","volume":"11","author":"MB Smyth","year":"1982","unstructured":"Smyth, M.B., Plotkin, G.D.: The category-theoretic solution of recursive domain equations. SIAM J. Comput. 11(4), 761\u2013783 (1982)","journal-title":"SIAM J. Comput."},{"key":"13_CR32","doi-asserted-by":"crossref","unstructured":"Soare, R.I.: Recursively Enumerable Sets and Degrees - A Study of Computable Functions and Computability Generated Sets. Perspectives in Mathematical Logic. Springer, Heidelberg (1987)","DOI":"10.1007\/978-3-662-02460-7"},{"key":"13_CR33","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":"13_CR34","doi-asserted-by":"crossref","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pac. J. Math. (1955)","DOI":"10.2140\/pjm.1955.5.285"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Image Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63735-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T21:04:32Z","timestamp":1721682272000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63735-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031637346","9783031637353"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63735-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"23 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Artificial Intelligence and Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fort Lauderdale, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 January 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 January 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/isaim2024.cs.ou.edu\/iwcia.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}