53 citations · 147 across the 32 of their papers we have counts for
4 papers · 2 filters
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…
Propagators and Solvers for the Algebra of Modular Systems
Bart Bogaerts, Eugenia Ternovska, David Mitchell
To appear in the proceedings of LPAR 21. Solving complex problems can involve non-trivial combinations of distinct knowledge bases and problem solvers. The Algebra of Modular Syste…