Marc Denecker
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Marc Denecker has a total of 107 co-authors. Here are the top co-authors by number of shared publications:
- Joost Vennekens
Vrije Universiteit Brussel
26 shared publications Maurice Bruynooghe
KU Leuven
21 shared publications- Bart Bogaerts
KU Leuven
18 shared publications - Maurice Bruynooghe
K.U. Leuven
13 shared publications Johan Wittocx
K.U. Leuven
9 shared publicationsOfer Arieli
The Academic College of Tel-Aviv, Israel
9 shared publications
Latest Publications
- 20 March 2026
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 94 (4) , 1-43
A prudent logic of partial functions
- 20 March 2026
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 94 (4) , 1-43
A prudent logic of partial functions
- Open Access
Approximation Fixpoint Theory with Refined Approximation Spaces
Approximation Fixpoint Theory (AFT) is a powerful theory covering various semantics of non-monotonic reasoning formalisms in knowledge representation such as Logic Programming and Answer Set Programming. Many semantics of such non-monotonic formalisms can be characterized as suitable fixpoints of a non-monotonic operator on a suitable lattice. Instead of working on the original lattice, AFT operates on intervals in such lattice to approximate or construct the fixpoints of interest. While AFT has been applied successfully across a broad range of non-monotonic reasoning formalisms, it is confronted by its limitations in other, relatively simple, examples. In this paper, we overcome those limitations by extending consistent AFT to deal with approximations that are more refined than intervals. Therefore, we introduce a more general notion of approximation spaces, showcase the improved expressiveness and investigate relations between different approximation spaces.
Open AccessApproximation Fixpoint Theory with Refined Approximation Spaces
Approximation Fixpoint Theory (AFT) is a powerful theory covering various semantics of non-monotonic reasoning formalisms in knowledge representation such as Logic Programming and Answer Set Programming. Many semantics of such non-monotonic formalisms can be characterized as suitable fixpoints of a non-monotonic operator on a suitable lattice. Instead of working on the original lattice, AFT operates on intervals in such lattice to approximate or construct the fixpoints of interest. While AFT has been applied successfully across a broad range of non-monotonic reasoning formalisms, it is confronted by its limitations in other, relatively simple, examples. In this paper, we overcome those limitations by extending consistent AFT to deal with approximations that are more refined than intervals. Therefore, we introduce a more general notion of approximation spaces, showcase the improved expressiveness and investigate relations between different approximation spaces.
- Open Access
- 13 February 2025
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 416, 253-266
Order-Sorted Intensional Logic: Expressing Subtyping Polymorphism with Typing Assertions and Quantification over Concepts
Subtyping, also known as subtype polymorphism, is a concept extensively studied in programming language theory, delineating the substitutability relation among datatypes. This property ensures that programs designed for supertype objects remain compatible with their subtypes. In this paper, we explore the capability of order-sorted logic for utilizing these ideas in the context of Knowledge Representation. We recognize two fundamental limitations: First, the inability of this logic to address the concept rather than the value of non-logical symbols, and second, the lack of language constructs for constraining the type of terms. Consequently, we propose guarded ordersorted intensional logic, where guards are language constructs for annotating typing information and intensional logic provides support for quantification over concepts.
- 13 February 2025
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 416, 253-266
Open AccessOrder-Sorted Intensional Logic: Expressing Subtyping Polymorphism with Typing Assertions and Quantification over Concepts
Subtyping, also known as subtype polymorphism, is a concept extensively studied in programming language theory, delineating the substitutability relation among datatypes. This property ensures that programs designed for supertype objects remain compatible with their subtypes. In this paper, we explore the capability of order-sorted logic for utilizing these ideas in the context of Knowledge Representation. We recognize two fundamental limitations: First, the inability of this logic to address the concept rather than the value of non-logical symbols, and second, the lack of language constructs for constraining the type of terms. Consequently, we propose guarded ordersorted intensional logic, where guards are language constructs for annotating typing information and intensional logic provides support for quantification over concepts.
- 9 October 2024
- Published by Springer Nature
- p. 317-330
A Category-Theoretic Perspective on Higher-Order Approximation Fixpoint Theory
- 9 October 2024
- Published by Springer Nature
- p. 317-330
A Category-Theoretic Perspective on Higher-Order Approximation Fixpoint Theory
- 9 October 2024
- Published by Springer Nature
- p. 30-42
A Sequent Calculus for Generalized Inductive Definitions
- 9 October 2024
- Published by Springer Nature
- p. 30-42
A Sequent Calculus for Generalized Inductive Definitions
- 23 July 2024
- Published by Springer Nature
- p. 218-235
Towards a Unifying View on Monotone Constructive Definitions
- 23 July 2024
- Published by Springer Nature
- p. 218-235
Towards a Unifying View on Monotone Constructive Definitions
- Open Access
- 8 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 789-793
An epistemic logic for modeling decisions in the context of incomplete knowledge
Modeling decisions in the context of incomplete knowledge is a challenging problem. We argue that none of the existing formalisms for modeling decisions are capable of correctly capturing the epistemic nature of such decisions. This paper presents a new language for modeling decisions with incomplete knowledge combining three principles: stratification, autoepistemic logic, and definitions.
- 8 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 789-793
Open AccessAn epistemic logic for modeling decisions in the context of incomplete knowledge
Modeling decisions in the context of incomplete knowledge is a challenging problem. We argue that none of the existing formalisms for modeling decisions are capable of correctly capturing the epistemic nature of such decisions. This paper presents a new language for modeling decisions with incomplete knowledge combining three principles: stratification, autoepistemic logic, and definitions.
- Open Access
- 24 March 2024
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 38 (8) , 7961-7968
Using Symmetries to Lift Satisfiability Checking
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 possibility to solve satisfiability problems in the compressed domain for better performance. Thus, we propose a 2-step novel method: (i) the sentence to be satisfied is automatically translated into an equisatisfiable sentence over a ``lifted'' vocabulary that allows domain compression; (ii) satisfiability of the lifted sentence is checked by growing the (initially unknown) compressed domain until a satisfying structure is found. The key issue is to ensure that this satisfying structure can always be expanded into an uncompressed structure that satisfies the original sentence to be satisfied. We present an adequate translation for sentences in typed first-order logic extended with aggregates. Our experimental evaluation shows large speedups for generative configuration problems. The method also has applications in the verification of software operating on complex data structures. Our results justify further research in automatic translation of sentences for symmetry reduction.
- 24 March 2024
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 38 (8) , 7961-7968
Open AccessUsing Symmetries to Lift Satisfiability Checking
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 possibility to solve satisfiability problems in the compressed domain for better performance. Thus, we propose a 2-step novel method: (i) the sentence to be satisfied is automatically translated into an equisatisfiable sentence over a ``lifted'' vocabulary that allows domain compression; (ii) satisfiability of the lifted sentence is checked by growing the (initially unknown) compressed domain until a satisfying structure is found. The key issue is to ensure that this satisfying structure can always be expanded into an uncompressed structure that satisfies the original sentence to be satisfied. We present an adequate translation for sentences in typed first-order logic extended with aggregates. Our experimental evaluation shows large speedups for generative configuration problems. The method also has applications in the verification of software operating on complex data structures. Our results justify further research in automatic translation of sentences for symmetry reduction.
- 16 March 2024
- Published by Elsevier in Artificial Intelligence
- Vol. 331
Embedding justification theory in approximation fixpoint theory
- 16 March 2024
- Published by Elsevier in Artificial Intelligence
- Vol. 331
Embedding justification theory in approximation fixpoint theory
- Open Access
An epistemic logic for modeling decisions in the context of incomplete knowledge
Substantial efforts have been made in developing various Decision Modeling formalisms, both from industry and academia. A challenging problem is that of expressing decision knowledge in the context of incomplete knowledge. In such contexts, decisions depend on what is known or not known. We argue that none of the existing formalisms for modeling decisions are capable of correctly capturing the epistemic nature of such decisions, inevitably causing issues in situations of uncertainty. This paper presents a new language for modeling decisions with incomplete knowledge. It combines three principles: stratification, autoepistemic logic, and definitions. A knowledge base in this language is a hierarchy of epistemic theories, where each component theory may epistemically reason on the knowledge in lower theories, and decisions are made using definitions with epistemic conditions.
Open AccessAn epistemic logic for modeling decisions in the context of incomplete knowledge
Substantial efforts have been made in developing various Decision Modeling formalisms, both from industry and academia. A challenging problem is that of expressing decision knowledge in the context of incomplete knowledge. In such contexts, decisions depend on what is known or not known. We argue that none of the existing formalisms for modeling decisions are capable of correctly capturing the epistemic nature of such decisions, inevitably causing issues in situations of uncertainty. This paper presents a new language for modeling decisions with incomplete knowledge. It combines three principles: stratification, autoepistemic logic, and definitions. A knowledge base in this language is a hierarchy of epistemic theories, where each component theory may epistemically reason on the knowledge in lower theories, and decisions are made using definitions with epistemic conditions.