4 papers · 1 filter
A Category-Theoretic Perspective on Higher-Order Approximation Fixpoint Theory
Samuele Pollaci, Babis Kostopoulos, Marc Denecker +1
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-…
Preservation theorems for Tarski's relation algebra
Bart Bogaerts, Balder ten Cate, Brett McLean +1
We investigate a number of semantically defined fragments of Tarski's algebra of binary relations, including the function-preserving fragment. We address the question whether they…
The Stable Model Semantics for Higher-Order Logic Programming
Bart Bogaerts, Angelos Charalambidis, Giannos Chatziagapis +3
We propose a stable model semantics for higher-order logic programs. Our semantics is developed using Approximation Fixpoint Theory (AFT), a powerful formalism that has successfull…
Executable First-Order Queries in the Logic of Information Flows
Heba Aamer, Bart Bogaerts, Dimitri Surinx +2
The logic of information flows (LIF) has recently been proposed as a general framework in the field of knowledge representation. In this framework, tasks of procedural nature can s…