Jesse Heyninck
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jesse Heyninck has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
- Christian Straßer
Ruhr University Bochum
5 shared publications - Gabriele Kern-Isberner
TU Dortmund University
5 shared publications - Ofer Arieli
School of Computer Science, Tel-Aviv Academic College, Tel-Aviv, Israel
5 shared publications - Thomas Meyer
University of Cape Town and CAIR Cape Town South Africa
4 shared publications - Christoph Beierle
FernUniversität in Hagen
3 shared publications - Bart Bogaerts
KU Leuven
2 shared publications
Latest Publications
- 25 July 2026
- Published by AI Access Foundation in Journal of Artificial Intelligence Research
- Vol. 86
Extension-ranking Semantics for Abstract Argumentation
In this paper, we present a general framework for ranking sets of arguments in abstract argumentation frameworks based on their plausibility of acceptance. We present a generalisation of Dung’s extension semantics as extension-ranking semantics, which induce a preorder over the power set of all arguments, allowing us to state that one set is “closer” to being acceptable than another. To evaluate the extension-ranking semantics, we introduce a number of principles that a well-behaved extensionranking semantics should satisfy. We consider several simple base relations, each of which models a single central aspect of argumentative reasoning. The combination of these base relations provides us with a family of extension-ranking semantics.
- 25 July 2026
- Published by AI Access Foundation in Journal of Artificial Intelligence Research
- Vol. 86
Extension-ranking Semantics for Abstract Argumentation
In this paper, we present a general framework for ranking sets of arguments in abstract argumentation frameworks based on their plausibility of acceptance. We present a generalisation of Dung’s extension semantics as extension-ranking semantics, which induce a preorder over the power set of all arguments, allowing us to state that one set is “closer” to being acceptable than another. To evaluate the extension-ranking semantics, we introduce a number of principles that a well-behaved extensionranking semantics should satisfy. We consider several simple base relations, each of which models a single central aspect of argumentative reasoning. The combination of these base relations provides us with a family of extension-ranking semantics.
- Open Access
- 23 April 2026
- Published by SAGE Publications in The European Journal on Artificial Intelligence
- Vol. 39 (4) , 747-776
Conditional Syntax and Semantic Splittings of Strongly and Weakly Consistent Belief Bases
Conditional syntax splitting for inductive inference from conditional belief bases has been proposed as a generalization of syntax splitting, which also covers cases where the conditionals in the subbases may share some atoms. While p-entailment and system Z fail to satisfy conditional syntax splitting, two other inductive inference operators, lexicographic inference and system W, have been shown to satisfy this property for reasoning from strongly consistent belief bases. In this article, we introduce the concept of conditional semantic splitting of a belief base. For both syntax splitting and semantic splitting, we take not only strongly consistent belief bases into account, but also belief bases that are only weakly consistent, enforcing some worlds to be fully infeasible. We show that c-representations satisfy a core postulate relating conditional splittings on the syntax and the semantic level. Based on these findings, we investigate conditional syntax splitting for nonmonotonic inference with c-representations. Regarding single c-representations, we utilize the concept of selection strategies and show that a straightforward property of the selection strategy leads to inference operators satisfying conditional syntax splittings. Furthermore, we show that c-inference, taking all c-representations of a belief base into account fully complies with conditional syntax splitting, and we prove that credulous and weakly skeptical inference based on c-representations also satisfies conditional syntax splitting. In particular, we show that these syntax splitting properties hold for strongly consistent belief bases and also in the case of only weakly consistent belief bases.
- 23 April 2026
- Published by SAGE Publications in The European Journal on Artificial Intelligence
- Vol. 39 (4) , 747-776
Open AccessConditional Syntax and Semantic Splittings of Strongly and Weakly Consistent Belief Bases
Conditional syntax splitting for inductive inference from conditional belief bases has been proposed as a generalization of syntax splitting, which also covers cases where the conditionals in the subbases may share some atoms. While p-entailment and system Z fail to satisfy conditional syntax splitting, two other inductive inference operators, lexicographic inference and system W, have been shown to satisfy this property for reasoning from strongly consistent belief bases. In this article, we introduce the concept of conditional semantic splitting of a belief base. For both syntax splitting and semantic splitting, we take not only strongly consistent belief bases into account, but also belief bases that are only weakly consistent, enforcing some worlds to be fully infeasible. We show that c-representations satisfy a core postulate relating conditional splittings on the syntax and the semantic level. Based on these findings, we investigate conditional syntax splitting for nonmonotonic inference with c-representations. Regarding single c-representations, we utilize the concept of selection strategies and show that a straightforward property of the selection strategy leads to inference operators satisfying conditional syntax splittings. Furthermore, we show that c-inference, taking all c-representations of a belief base into account fully complies with conditional syntax splitting, and we prove that credulous and weakly skeptical inference based on c-representations also satisfies conditional syntax splitting. In particular, we show that these syntax splitting properties hold for strongly consistent belief bases and also in the case of only weakly consistent belief bases.
- Open Access
- 8 January 2026
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 439, 206-223
Defeasible Conditionals using Answer Set Programming
Defeasible entailment is concerned with drawing plausible conclusions from incomplete information. A foundational framework for modelling defeasible entailment is the KLM framework. Introduced by Kraus, Lehmann, and Magidor, the KLM framework outlines several key properties for defeasible entailment. One of the most prominent algorithms within this framework is Rational Closure (RC). This paper presents a declarative definition for computing RC using Answer Set Programming (ASP). Our approach enables the automatic construction of the minimal ranked model from a given knowledge base and supports entailment checking for specified queries. We formally prove the correctness of our ASP encoding and conduct empirical evaluations to compare the performance of our implementation with that of existing imperative implementations, specifically the InfOCF solver. The results demonstrate that our ASP-based approach adheres to RC's theoretical foundations and offers improved computational efficiency.
- 8 January 2026
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 439, 206-223
Open AccessDefeasible Conditionals using Answer Set Programming
Defeasible entailment is concerned with drawing plausible conclusions from incomplete information. A foundational framework for modelling defeasible entailment is the KLM framework. Introduced by Kraus, Lehmann, and Magidor, the KLM framework outlines several key properties for defeasible entailment. One of the most prominent algorithms within this framework is Rational Closure (RC). This paper presents a declarative definition for computing RC using Answer Set Programming (ASP). Our approach enables the automatic construction of the minimal ranked model from a given knowledge base and supports entailment checking for specified queries. We formally prove the correctness of our ASP encoding and conduct empirical evaluations to compare the performance of our implementation with that of existing imperative implementations, specifically the InfOCF solver. The results demonstrate that our ASP-based approach adheres to RC's theoretical foundations and offers improved computational efficiency.
- Open Access
- 8 January 2026
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 439, 114-127
Interpretable Hybrid Machine Learning Models Using FOLD-R++ and Answer Set Programming
Machine learning (ML) techniques play a pivotal role in high-stakes domains such as healthcare, where accurate predictions can greatly enhance decision-making. However, most high-performing methods such as neural networks and ensemble methods are often opaque, limiting trust and broader adoption. In parallel, symbolic methods like Answer Set Programming (ASP) offer the possibility of interpretable logical rules but do not always match the predictive power of ML models. This paper proposes a hybrid approach that integrates ASP-derived rules from the FOLD-R++ algorithm with black-box ML classifiers to selectively correct uncertain predictions and provide human-readable explanations. Experiments on five medical reveal statistically significant performance gains in accuracy and F1 score. This study underscores the potential of combining symbolic reasoning with conventional ML to achieve high interpretability without sacrificing accuracy
- 8 January 2026
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 439, 114-127
Open AccessInterpretable Hybrid Machine Learning Models Using FOLD-R++ and Answer Set Programming
Machine learning (ML) techniques play a pivotal role in high-stakes domains such as healthcare, where accurate predictions can greatly enhance decision-making. However, most high-performing methods such as neural networks and ensemble methods are often opaque, limiting trust and broader adoption. In parallel, symbolic methods like Answer Set Programming (ASP) offer the possibility of interpretable logical rules but do not always match the predictive power of ML models. This paper proposes a hybrid approach that integrates ASP-derived rules from the FOLD-R++ algorithm with black-box ML classifiers to selectively correct uncertain predictions and provide human-readable explanations. Experiments on five medical reveal statistically significant performance gains in accuracy and F1 score. This study underscores the potential of combining symbolic reasoning with conventional ML to achieve high interpretability without sacrificing accuracy
- Open Access
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 3, 2684-2692
A Unifying Framework for Semiring-Based Constraint Logic Programming With Negation
Constraint Logic Programming (CLP) is a logic programming formalism used to solve problems requiring the consideration of constraints, like resource allocation and automated planning and scheduling. It has previously been extended in various directions, for example to support fuzzy constraint satisfaction, uncertainty, or negation, with different notions of semiring being used as a unifying abstraction for these generalisations. None of these extensions have studied clauses with negation allowed in the body. We investigate an extension of CLP which unifies many of these extensions and allows negation in the body. We provide semantics for such programs, using the framework of approximation fixpoint theory, and give a detailed overview of the impacts of properties of the semirings on the resulting semantics. As such, we provide a unifying framework that captures existing approaches and allows to extend them with a more expressive language.
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 3, 2684-2692
Open AccessA Unifying Framework for Semiring-Based Constraint Logic Programming With Negation
Constraint Logic Programming (CLP) is a logic programming formalism used to solve problems requiring the consideration of constraints, like resource allocation and automated planning and scheduling. It has previously been extended in various directions, for example to support fuzzy constraint satisfaction, uncertainty, or negation, with different notions of semiring being used as a unifying abstraction for these generalisations. None of these extensions have studied clauses with negation allowed in the body. We investigate an extension of CLP which unifies many of these extensions and allows negation in the body. We provide semantics for such programs, using the framework of approximation fixpoint theory, and give a detailed overview of the impacts of properties of the semirings on the resulting semantics. As such, we provide a unifying framework that captures existing approaches and allows to extend them with a more expressive language.
- Open Access
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 5, 4544-4552
Approximation Fixpoint Theory as a Unifying Framework for Fuzzy Logic Programming Semantics
Fuzzy logic programming is an established approach for reasoning under uncertainty. Several semantics from classical, two-valued logic programming have been generalized to the case of fuzzy logic programs. In this paper, we show that two of the most prominent classical semantics, namely the stable model and the well-founded semantics, can be reconstructed within the general framework of approximation fixpoint theory (AFT). This not only widens the scope of AFT from two- to many-valued logics, but allows a wide range of existing AFT results to be applied to fuzzy logic programming. As first examples of such applications, we clarify the formal relationship between existing semantics, generalize the notion of stratification from classical to fuzzy logic programs, and devise “more precise” variants of the semantics.
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 5, 4544-4552
Open AccessApproximation Fixpoint Theory as a Unifying Framework for Fuzzy Logic Programming Semantics
Fuzzy logic programming is an established approach for reasoning under uncertainty. Several semantics from classical, two-valued logic programming have been generalized to the case of fuzzy logic programs. In this paper, we show that two of the most prominent classical semantics, namely the stable model and the well-founded semantics, can be reconstructed within the general framework of approximation fixpoint theory (AFT). This not only widens the scope of AFT from two- to many-valued logics, but allows a wide range of existing AFT results to be applied to fuzzy logic programming. As first examples of such applications, we clarify the formal relationship between existing semantics, generalize the notion of stratification from classical to fuzzy logic programs, and devise “more precise” variants of the semantics.
- Open Access
- 26 August 2025
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 25 (5) , 896-923
Argumentative Characterizations of (Extended) Disjunctive Logic Programs
This paper continues an established line of research about the relations between argumentation theory, particularly assumption-based argumentation, and different kinds of logic programs. In particular, we extend known result of Bondarenko, Dung, Kowalski and Toni, and of Caminada and Schulz, by showing that assumption-based argumentation can represent not only normal logic programs, but also disjunctive logic programs under the stable model semantics. For this, we consider some inference rules for disjunction that the core logic of the argumentation frameworks should respect, and show the correspondence to the handling of disjunctions in the heads of the logic programs’ rules.
- 26 August 2025
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 25 (5) , 896-923
Open AccessArgumentative Characterizations of (Extended) Disjunctive Logic Programs
This paper continues an established line of research about the relations between argumentation theory, particularly assumption-based argumentation, and different kinds of logic programs. In particular, we extend known result of Bondarenko, Dung, Kowalski and Toni, and of Caminada and Schulz, by showing that assumption-based argumentation can represent not only normal logic programs, but also disjunctive logic programs under the stable model semantics. For this, we consider some inference rules for disjunction that the core logic of the argumentation frameworks should respect, and show the correspondence to the handling of disjunctions in the heads of the logic programs’ rules.
- Open Access
A Unifying Framework for Semiring-Based Constraint Logic Programming With Negation (full version)
Constraint Logic Programming (CLP) is a logic programming formalism used to solve problems requiring the consideration of constraints, like resource allocation and automated planning and scheduling. It has previously been extended in various directions, for example to support fuzzy constraint satisfaction, uncertainty, or negation, with different notions of semiring being used as a unifying abstraction for these generalizations. None of these extensions have studied clauses with negation allowed in the body. We investigate an extension of CLP which unifies many of these extensions and allows negation in the body. We provide semantics for such programs, using the framework of approximation fixpoint theory, and give a detailed overview of the impacts of properties of the semirings on the resulting semantics. As such, we provide a unifying framework that captures existing approaches and allows extending them with a more expressive language.
Open AccessA Unifying Framework for Semiring-Based Constraint Logic Programming With Negation (full version)
Constraint Logic Programming (CLP) is a logic programming formalism used to solve problems requiring the consideration of constraints, like resource allocation and automated planning and scheduling. It has previously been extended in various directions, for example to support fuzzy constraint satisfaction, uncertainty, or negation, with different notions of semiring being used as a unifying abstraction for these generalizations. None of these extensions have studied clauses with negation allowed in the body. We investigate an extension of CLP which unifies many of these extensions and allows negation in the body. We provide semantics for such programs, using the framework of approximation fixpoint theory, and give a detailed overview of the impacts of properties of the semirings on the resulting semantics. As such, we provide a unifying framework that captures existing approaches and allows extending them with a more expressive language.
- Open Access
Approximation Fixpoint Theory as a Unifying Framework for Fuzzy Logic Programming Semantics (Extended Version)
Fuzzy logic programming is an established approach for reasoning under uncertainty. Several semantics from classical, two-valued logic programming have been generalized to the case of fuzzy logic programs. In this paper, we show that two of the most prominent classical semantics, namely the stable model and the well-founded semantics, can be reconstructed within the general framework of approximation fixpoint theory (AFT). This not only widens the scope of AFT from two- to many-valued logics, but allows a wide range of existing AFT results to be applied to fuzzy logic programming. As first examples of such applications, we clarify the formal relationship between existing semantics, generalize the notion of stratification from classical to fuzzy logic programs, and devise "more precise" variants of the semantics.
Open AccessApproximation Fixpoint Theory as a Unifying Framework for Fuzzy Logic Programming Semantics (Extended Version)
Fuzzy logic programming is an established approach for reasoning under uncertainty. Several semantics from classical, two-valued logic programming have been generalized to the case of fuzzy logic programs. In this paper, we show that two of the most prominent classical semantics, namely the stable model and the well-founded semantics, can be reconstructed within the general framework of approximation fixpoint theory (AFT). This not only widens the scope of AFT from two- to many-valued logics, but allows a wide range of existing AFT results to be applied to fuzzy logic programming. As first examples of such applications, we clarify the formal relationship between existing semantics, generalize the notion of stratification from classical to fuzzy logic programs, and devise "more precise" variants of the semantics.
- Open Access
- 11 April 2025
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 39 (14) , 14967-14975
An Algebraic Notion of Conditional Independence, and Its Application to Knowledge Representation
Conditional independence is a crucial concept supporting adequate modelling and efficient reasoning in probabilistics. In knowledge representation, the idea of conditional independence has also been introduced for specific formalisms, such as propositional logic and belief revision. In this paper, the notion of conditional independence is studied in the algebraic framework of approximation fixpoint theory. This gives a language-independent account of conditional independence that can be straightforwardly applied to any logic with fixpoint semantics. It is shown how this notion allows to reduce global reasoning to parallel instances of local reasoning, leading to fixed-parameter tractability results. Furthermore, relations to existing notions of conditional independence are discussed and the framework is applied to normal logic programming.
- 11 April 2025
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 39 (14) , 14967-14975
Open AccessAn Algebraic Notion of Conditional Independence, and Its Application to Knowledge Representation
Conditional independence is a crucial concept supporting adequate modelling and efficient reasoning in probabilistics. In knowledge representation, the idea of conditional independence has also been introduced for specific formalisms, such as propositional logic and belief revision. In this paper, the notion of conditional independence is studied in the algebraic framework of approximation fixpoint theory. This gives a language-independent account of conditional independence that can be straightforwardly applied to any logic with fixpoint semantics. It is shown how this notion allows to reduce global reasoning to parallel instances of local reasoning, leading to fixed-parameter tractability results. Furthermore, relations to existing notions of conditional independence are discussed and the framework is applied to normal logic programming.