9 citations · 15 across the 12 of their papers we have counts for
6 papers · 1 filter
Interactive Model Expansion in an Observable Environment
Pierre Carbonnelle, Joost Vennekens, Bart Bogaerts +1
Many practical problems can be understood as the search for a state of affairs that extends a fixed partial state of affairs, the \emph{environment}, while satisfying certain condi…
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…
Tree-Like Justification Systems are Consistent
Simon Marynissen, Bart Bogaerts
Justification theory is an abstract unifying formalism that captures semantics of various non-monotonic logics. One intriguing problem that has received significant attention is th…
BreakID: Static Symmetry Breaking for ASP (System Description)
Jo Devriendt, Bart Bogaerts
Symmetry breaking has been proven to be an efficient preprocessing technique for satisfiability solving (SAT). In this paper, we port the state-of-the-art SAT symmetry breaker Brea…
Implementing a Relevance Tracker Module
Joachim Jansen, Jo Devriendt, Bart Bogaerts +2
PC(ID) extends propositional logic with inductive definitions: rule sets under the well-founded semantics. Recently, a notion of relevance was introduced for this language. This no…
Stable-Unstable Semantics: Beyond NP with Normal Logic Programs
Bart Bogaerts, Tomi Janhunen, Shahab Tasharrofi
Standard answer set programming (ASP) targets at solving search problems from the first level of the polynomial time hierarchy (PH). Tackling search problems beyond NP using ASP is…