201 citations · 1.5k across the 125 of their papers we have counts for
Showing 2013 · cs.LOShow all
2 papers · 2 filters
cs.LO2013
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…
cs.LO2013
Global SPACING Constraint (Technical Report)
Nina Narodytska, Peter Skocovsky, Toby Walsh
We propose a new global SPACING constraint that is useful in modeling events that are distributed over time, like learning units scheduled over a study program or repeated patterns…