A Category-Theoretic Perspective on Higher-Order Approximation Fixpoint Theory
Theory and Practice of Logic Programming · 2026-05 · 26 (3-4) · 394-427
DOI: 10.1017/s1471068425100367 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theory and Practice of Logic Programming, online erschienen am 02.12.2025. Verfasst von SAMUELE POLLACI und 3 weiteren Autor:innen. Die Arbeit nennt 32 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Approximation fixpoint theory (AFT) is an algebraic framework designed to study the semantics of non-monotonic logics. Despite its success, AFT is not readily applicable to higher-order definitions. To solve such an issue, we devise a formal mathematical framework employing concepts drawn from category theory. In particular, we make use of the notion of Cartesian closed category to inductively construct higher-order approximation spaces while preserving the structures necessary for the correct application of AFT. We show that this novel theoretical approach extends standard AFT to a higher-order environment and generalizes the AFT setting of Charalambidis et al. (2018).
Zitieren
APA
POLLACI, S., KOSTOPOULOS, B., DENECKER, M., & BOGAERTS, B. (2026). A Category-Theoretic Perspective on Higher-Order Approximation Fixpoint Theory. Theory and Practice of Logic Programming, 26(3-4), 394-427. https://doi.org/10.1017/s1471068425100367
Vancouver
POLLACI S, KOSTOPOULOS B, DENECKER M, BOGAERTS B. A Category-Theoretic Perspective on Higher-Order Approximation Fixpoint Theory. Theory and Practice of Logic Programming. 2026;26(3-4):394-427. doi:10.1017/s1471068425100367
BibTeX
@article{POLLACI2026,
author = {POLLACI, SAMUELE and KOSTOPOULOS, BABIS and DENECKER, MARC and BOGAERTS, BART},
title = {A Category-Theoretic Perspective on Higher-Order Approximation Fixpoint Theory},
journal = {Theory and Practice of Logic Programming},
year = {2026},
volume = {26},
number = {3-4},
pages = {394--427},
doi = {10.1017/s1471068425100367}
}
EUVIMED