53 citations · 251 across the 46 of their papers we have counts for
47 papers
Transforming Constraint Programs to Input for Local Search
Jo Devriendt, Patrick De Causmaecker, Marc Denecker
Applying local search algorithms to combinatorial optimization problems is not an easy feat. Typically, human intervention is required to compile the constraints to input data for…
A Sequent Calculus for Non-Monotone Inductive Definitions
Robbe Van den Eede, Marc Denecker
Inductive definitions constitute an important form of knowledge. The logic FO(ID) is an extension of classical first-order logic (FO) with a language construct to express non-monot…
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…
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-…
An epistemic logic for modeling decisions in the context of incomplete knowledge
Đorđe Marković, Simon Vandevelde, Linde Vanbesien +2
Substantial efforts have been made in developing various Decision Modeling formalisms, both from industry and academia. A challenging problem is that of expressing decision knowled…
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…