eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2016-11-11
6:1
6:15
10.4230/OASIcs.ICLP.2016.6
article
Justifications and Blocking Sets in a Rule-Based Answer Set Computation
Béatrix, Christopher
Lefèvre, Claire
Garcia, Laurent
Stéphan, Igor
Notions of justifications for logic programs under answer set semantics have been recently studied for atom-based approaches or argumentation approaches. The paper addresses the question in a rule-based answer set computation: the search algorithm does not guess on the truth or falsity of an atom but on the application or non application of a non monotonic rule. In this view, justifications are sets of ground rules with particular properties. Properties of these justifications are established; in particular the notion of blocking set (a reason incompatible with an answer set) is defined, that permits to explain computation failures. Backjumping, learning, debugging and explanations are possible applications.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol052_iclp2016/OASIcs.ICLP.2016.6/OASIcs.ICLP.2016.6.pdf
Answer Set Programming
Justification
Rule-based Computation