6 citations · 13 across the 11 of their papers we have counts for
5 papers · 1 filter
Efficient Approximation of Well-Founded Justification and Well-Founded Domination (Corrected and Extended Version)
Christian Drescher, Toby Walsh
Many native ASP solvers exploit unfounded sets to compute consequences of a logic program via some form of well-founded negation, but disregard its contrapositive, well-founded jus…
Symmetry Breaking for Distributed Multi-Context Systems
Christian Drescher, Thomas Eiter, Michael Fink +2
Heterogeneous nonmonotonic multi-context systems (MCS) permit different logics to be used in different contexts, and link them via bridge rules. We investigate the role of symmetry…
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…