6 citations · 13 across the 11 of their papers we have counts for
Showing 2010 · cs.LOShow all
3 papers · 2 filters
cs.LO2010
Symmetry Breaking for Answer Set Programming
Christian Drescher
In the context of answer set programming, this work investigates symmetry detection and symmetry breaking to eliminate symmetric parts of the search space and, thereby, simplify th…
cs.LO2010
Reformulation of Global Constraints in Answer Set Programming
Christian Drescher, Toby Walsh
We show that global constraints on finite domains like all-different can be reformulated into answer set programs on which we achieve arc, bound or range consistency. These reformu…
cs.LO2010★ 3 cited
Symmetry-breaking Answer Set Solving
Christian Drescher, Oana Tifrea, Toby Walsh
In the context of Answer Set Programming, this paper investigates symmetry-breaking to eliminate symmetric parts of the search space and, thereby, simplify the solution process. We…