4 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 General Inductive Definitions
Robbe Van den Eede, Marc Denecker
Inductive definitions are an important form of knowledge. The logic FO(ID) is an extension of classical first-order logic FO with general non-monotone inductive definitions. Most e…
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-…
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…