2 citations · 3 across the 4 of their papers we have counts for
5 papers · 1 filter
An Algebraic Notion of Conditional Independence, and Its Application to Knowledge Representation (full version)
Jesse Heyninck
Conditional independence is a crucial concept supporting adequate modelling and efficient reasoning in probabilistics. In knowledge representation, the idea of conditional independ…
Operator-based semantics for choice programs: is choosing losing? (full version)
Jesse Heyninck
Choice constructs are an important part of the language of logic programming, yet the study of their semantics has been a challenging task. So far, only two-valued semantics have b…
Abstract Dialectical Frameworks are Boolean Networks (full version)
Jesse Heyninck, Matthias Knorr, João Leite
Dialectical frameworks are a unifying model of formal argumentation, where argumentative relations between arguments are represented by assigning acceptance conditions to atomic ar…
Ranking-based Argumentation Semantics Applied to Logical Argumentation (full version)
Jesse Heyninck, Badran Raddaoui, Christian Straßer
In formal argumentation, a distinction can be made between extension-based semantics, where sets of arguments are either (jointly) accepted or not, and ranking-based semantics, whe…
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…