53 citations · 147 across the 32 of their papers we have counts for
8 papers · 1 filter
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…
Interactive Model Expansion in an Observable Environment
Pierre Carbonnelle, Joost Vennekens, Bart Bogaerts +1
Many practical problems can be understood as the search for a state of affairs that extends a fixed partial state of affairs, the \emph{environment}, while satisfying certain condi…
Non-deterministic approximation operators: ultimate operators, semi-equilibrium semantics and aggregates (full version)
Jesse Heyninck, Bart Bogaerts
Approximation fixpoint theory (AFT) is an abstract and general algebraic framework for studying the semantics of non-monotonic logics. In recent work, AFT was generalized to non-de…
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…