9 citations · 12 across the 6 of their papers we have counts for
6 papers
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…
FO(C): A Knowledge Representation Language of Causality
Bart Bogaerts, Joost Vennekens, Marc Denecker +1
Cause-effect relations are an important part of human knowledge. In real life, humans often reason about complex causes linked to complex effects. By comparison, existing formalism…
FO(C) and Related Modelling Paradigms
Bart Bogaerts, Joost Vennekens, Marc Denecker +1
Recently, C-Log was introduced as a language for modelling causal processes. Its formal semantics has been defined together with introductory examples, but the study of this langua…
Inference in the FO(C) Modelling Language
Bart Bogaerts, Joost Vennekens, Marc Denecker +1
Recently, FO(C), the integration of C-Log with classical logic, was introduced as a knowledge representation language. Up to this point, no systems exist that perform inference on…