3 citations · 5 across the 4 of their papers we have counts for
4 papers
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…
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…
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…
A Translational Approach to Constraint Answer Set Solving
Christian Drescher, Toby Walsh
We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in A…