Cabalar, PedroMuñiz, Brais2024-04-162024-04-162024-02P. Cabalar y B. Muñiz, «Model Explanation via Support Graphs», Theory and Practice of Logic Programming, pp. 1-14, feb. 2024, doi: 10.1017/S1471068424000048.1471-06841475-3081http://hdl.handle.net/2183/36215[Absctract]: In this note, we introduce the notion of support graph to define explanations for any model of a logic program. An explanation is an acyclic support graph that, for each true atom in the model, induces a proof in terms of program rules represented by labels. A classical model may have zero, one or several explanations: when it has at least one, it is called a justified model. We prove that all stable models are justified, whereas, for disjunctive programs, some justified models may not be stable. We also provide a meta-programming encoding in Answer Set Programming that generates the explanations for a given stable model of some program. We prove that the encoding is sound and complete, that is, there is a one-to-one correspondence between each answer set of the encoding and each explanation for the original stable model.engAtribución 3.0 Españahttp://creativecommons.org/licenses/by/3.0/es/Answer set programmingExplanationsSupported modelsJustified modelsjournal articleopen access