{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T03:09:49Z","timestamp":1768446589610,"version":"3.49.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031742088","type":"print"},{"value":"9783031742095","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-74209-5_24","type":"book-chapter","created":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T06:01:44Z","timestamp":1728626504000},"page":"317-330","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Category-Theoretic Perspective on\u00a0Higher-Order Approximation Fixpoint Theory"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2914-787X","authenticated-orcid":false,"given":"Samuele","family":"Pollaci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-8734-4540","authenticated-orcid":false,"given":"Babis","family":"Kostopoulos","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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3460-4251","authenticated-orcid":false,"given":"Bart","family":"Bogaerts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,9]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"103370","DOI":"10.1016\/j.artint.2020.103370","volume":"288","author":"C Antic","year":"2020","unstructured":"Antic, C.: Fixed point semantics for stream reasoning. Artif. Intell. 288, 103370 (2020)","journal-title":"Artif. Intell."},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Bogaerts, B.: Weighted abstract dialectical frameworks through the lens of approximation fixpoint theory. In: AAAI, pp. 2686\u20132693. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33012686"},{"key":"24_CR3","unstructured":"Bogaerts, B., Charalambidis, A., Chatziagapis, G., Kostopoulos, B., Pollaci, S., Rondogiannis, P.: The stable model semantics for higher-order logic programming. In: ICLP 2024 (2024, to appear)"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.artint.2017.11.003","volume":"255","author":"B Bogaerts","year":"2018","unstructured":"Bogaerts, B., Cruz-Filipe, L.: Fixpoint semantics for active integrity constraints. Artif. Intell. 255, 43\u201370 (2018)","journal-title":"Artif. Intell."},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Bogaerts, B., Jakubowski, M.: Fixpoint semantics for recursive SHACL. In: ICLP Technical Communications. EPTCS, vol. 345, pp. 41\u201347 (2021)","DOI":"10.4204\/EPTCS.345.14"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-031-43619-2_35","volume-title":"Logics in Artificial Intelligence","author":"A Charalambidis","year":"2023","unstructured":"Charalambidis, A., Rondogiannis, P.: Categorical approximation fixpoint theory. In: Gaggl, S., Martinez, M.V., Ortiz, M. (eds.) JELIA 2023. LNCS, vol. 14281, pp. 515\u2013530. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-43619-2_35"},{"issue":"3\u20134","key":"24_CR7","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1017\/S1471068418000108","volume":"18","author":"A Charalambidis","year":"2018","unstructured":"Charalambidis, A., Rondogiannis, P., Symeonidou, I.: Approximation fixpoint theory and the well-founded semantics of higher-order logic programs. Theory Pract. Log. Program. 18(3\u20134), 421\u2013437 (2018)","journal-title":"Theory Pract. Log. Program."},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Clark, K.L.: Negation as failure. In: Logic and Data Bases. Advances in Data Base Theory, , pp. 293\u2013322. Plemum Press, New York (1977)","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"24_CR9","unstructured":"Dasseville, I., van der Hallen, M., Bogaerts, B., Janssens, G., Denecker, M.: A compositional typed higher-order logic with definitions. In: ICLP (Technical Communications), OASIcs, vol.\u00a052, pp. 14:1\u201314:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"issue":"4\u20135","key":"24_CR10","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1017\/S1471068415000319","volume":"15","author":"I Dasseville","year":"2015","unstructured":"Dasseville, I., van der Hallen, M., Janssens, G., Denecker, M.: Semantics of templates in a compositional framework for building logics. Theory Pract. Log. Program. 15(4\u20135), 681\u2013695 (2015)","journal-title":"Theory Pract. Log. Program."},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-30743-0_13","volume-title":"Correct Reasoning","author":"M Denecker","year":"2012","unstructured":"Denecker, M., Bruynooghe, M., Vennekens, J.: Approximation fixpoint theory and the semantics of logic and answers set programs. In: Erdem, E., Lee, J., Lierler, Y., Pearce, D. (eds.) Correct Reasoning. LNCS, vol. 7265, pp. 178\u2013194. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30743-0_13"},{"key":"24_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"},{"key":"24_CR13","unstructured":"Denecker, M., Marek, V., Truszczy\u0144ski, M.: Reiter\u2019s default logic is a logic of autoepistemic reasoning and a good one, too. In: Brewka, G., Marek, V., Truszczy\u0144ski, M. (eds.) Nonmonotonic Reasoning \u2013 Essays Celebrating Its 30th Anniversary, pp. 111\u2013144, College Publications (2011). http:\/\/arxiv.org\/abs\/1108.3278"},{"issue":"1","key":"24_CR14","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.W., Truszczynski, M.: Uniform semantic treatment of default and autoepistemic logics. Artif. Intell. 143(1), 79\u2013122 (2003)","journal-title":"Artif. Intell."},{"issue":"1","key":"24_CR15","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.W., Truszczynski, M.: Ultimate approximation and its application in nonmonotonic knowledge representation systems. Inf. Comput. 192(1), 84\u2013121 (2004)","journal-title":"Inf. Comput."},{"issue":"4","key":"24_CR16","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. J. Log. Program. 2(4), 295\u2013312 (1985)","journal-title":"J. Log. Program."},{"issue":"1\u20132","key":"24_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0304-3975(00)00330-3","volume":"278","author":"M Fitting","year":"2002","unstructured":"Fitting, M.: Fixpoint semantics for logic programming a survey. Theor. Comput. Sci. 278(1\u20132), 25\u201351 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR18","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICLP\/SLP, pp. 1070\u20131080. MIT Press (1988)"},{"issue":"3","key":"24_CR19","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1017\/S1471068406002973","volume":"7","author":"N Pelov","year":"2007","unstructured":"Pelov, N., Denecker, M., Bruynooghe, M.: Well-founded and stable semantics of logic programs with aggregates. Theory Pract. Log. Program. 7(3), 301\u2013353 (2007)","journal-title":"Theory Pract. Log. Program."},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Pollaci, S., Kostopoulos, B., Denecker, M., Bogaerts, B.: A category-theoretic perspective on higher-order approximation fixpoint theory (extended version) (2024). https:\/\/arxiv.org\/abs\/2408.11712","DOI":"10.1007\/978-3-031-74209-5_24"},{"key":"24_CR21","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.artint.2013.09.004","volume":"205","author":"H Strass","year":"2013","unstructured":"Strass, H.: Approximating operators and semantics for abstract dialectical frameworks. Artif. Intell. 205, 39\u201370 (2013)","journal-title":"Artif. Intell."},{"issue":"4","key":"24_CR22","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"MH van Emden","year":"1976","unstructured":"van Emden, M.H., Kowalski, R.A.: The semantics of predicate logic as a programming language. J. ACM 23(4), 733\u2013742 (1976)","journal-title":"J. ACM"},{"issue":"3","key":"24_CR23","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A Van Gelder","year":"1991","unstructured":"Van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. J. ACM 38(3), 620\u2013650 (1991)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-74209-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T17:03:33Z","timestamp":1736615013000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74209-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,9]]},"ISBN":["9783031742088","9783031742095"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74209-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,9]]},"assertion":[{"value":"9 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LPNMR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Logic Programming and Nonmonotonic Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","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":"11 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lpnmr2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lpnmr2024.demacs.unical.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}