9 citations · 12 across the 7 of their papers we have counts for
Showing 2016 · cs.AIShow all
3 papers · 2 filters
cs.AI2016
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…
cs.AI2016
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…
cs.AI2016
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…