2026-07-22T08:34:54Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6731 2024-03-06T10:29:56Z ddc:004 open_access

Justifications and Blocking Sets in a Rule-Based Answer Set Computation Béatrix, Christopher Lefèvre, Claire Garcia, Laurent Stéphan, Igor Answer Set Programming Justification Rule-based Computation 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Christopher Béatrix and Claire Lefèvre and Laurent Garcia and Igor Stéphan 2016 Is Part Of OASIcs, Volume 52, Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ICLP.2016.6 urn:nbn:de:0030-drops-67310 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2016.6 eng https://creativecommons.org/licenses/by/3.0/legalcode