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…