exp(ASPc) : Explaining ASP Programs with Choice Atoms and Constraint Rules

We present an enhancement of exp(ASP), a system that generates explanation graphs for a literal l— an atom a or its default negation ∼ a—given an answer set A of a normal logic program P , which explain why l is true (or false) given A and P . The new system, exp(ASP), differs from exp(ASP) in that it supports choice rules and utilizes constraint rules to provide explanation graphs that include information about choices and constraints.

[1]  Francesca Toni,et al.  Justifying answer sets using argumentation , 2016, Theory Pract. Log. Program..

[2]  Gerda Janssens,et al.  Technical Communications of the 32nd International Conference on Logic Programming, ICLP 2016 , 2016, ICLP 2016.

[3]  Hans Tompits,et al.  VIDEAS: A Development Tool for Answer-Set Programs Based on Model-Driven Engineering Technology , 2011, LPNMR.

[4]  Jorge Fandinno,et al.  A System for Explainable Answer Set Programming , 2020, ICLP Technical Communications.

[5]  Hans Tompits,et al.  Stepwise debugging of answer-set programs* , 2017, Theory and Practice of Logic Programming.

[6]  Jorge Fandinno,et al.  Justifications for programs with disjunctive and causal-choice rules* , 2016, Theory and Practice of Logic Programming.

[7]  Marcello Balduccini,et al.  Generating explanations for answer set programming applications , 2021, Defense + Commercial Sensing.

[8]  Victor W. Marek,et al.  Stable models and an alternative logic programming paradigm , 1998, The Logic Programming Paradigm.

[9]  Ilkka Niemelä,et al.  Logic programs with stable model semantics as a constraint programming paradigm , 1999, Annals of Mathematics and Artificial Intelligence.

[10]  Enrico Pontelli,et al.  Under Consideration for Publication in Theory and Practice of Logic Programming Justifications for Logic Programs under Answer Set Semantics , 2022 .

[11]  Stefan Woltran,et al.  Debugging ASP Programs by Means of ASP , 2007, LPNMR.

[12]  Hans Tompits,et al.  A Meta-Programming Technique for Debugging Answer-Set Programs , 2008, AAAI.

[13]  H. Tompits,et al.  Catching the Ouroboros: On debugging non-ground answer-set programs , 2010, Theory and Practice of Logic Programming.

[14]  Igor Stéphan,et al.  Justifications and Blocking Sets in a Rule-Based Answer Set Computation , 2016, ICLP.

[15]  Timo Soininen,et al.  Extending and implementing the stable model semantics , 2000, Artif. Intell..

[16]  Torsten Schaub,et al.  A Tutorial on Hybrid Answer Set Solving with clingo , 2017, RW.

[17]  Grigoris Antoniou,et al.  Justifications for Logic Programming , 2013, LPNMR.