53 citations · 147 across the 32 of their papers we have counts for
34 papers
Approximation Fixpoint Theory with Refined Approximation Spaces
Linde Vanbesien, Bart Bogaerts, Marc Denecker
Approximation Fixpoint Theory (AFT) is a powerful theory covering various semantics of non-monotonic reasoning formalisms in knowledge representation such as Logic Programming and…
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…
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-…
Using Symmetries to Lift Satisfiability Checking
Pierre Carbonnelle, Gottfried Schenner, Maurice Bruynooghe +2
We analyze how symmetries can be used to compress structures (also known as interpretations) onto a smaller domain without loss of information. This analysis suggests the possibili…
Mathematical Foundations for Joining Only Knowing and Common Knowledge (Extended Version)
Marcos Cramer, Samuele Pollaci, Bart Bogaerts
Common knowledge and only knowing capture two intuitive and natural notions that have proven to be useful in a variety of settings, for example to reason about coordination or agre…
Distributed Autoepistemic Logic: Semantics, Complexity, and Applications to Access Control
Marcos Cramer, Pieter Van Hertum, Bart Bogaerts +1
In this paper we define and study a multi-agent extension of autoepistemic logic (AEL) called distributed autoepistemic logic (dAEL). We define the semantics of dAEL using approxim…