Justifications for Logic Programs Under Answer Set Semantics

The paper introduces the notion of off-line justification for Answer Set Programming (ASP). Justifications provide a graph-based explanation of the truth value of an atom w.r.t. a given answer set. The notion of justification accounts for the specifics of answer set semantics. The paper extends also this notion to provide justification of atoms during the computation of an answer set (on-line justification), and presents an integration of on-line justifications within the computation model of Smodels. Justifications offer a basic data structure to support methodologies and tools for debugging answer set programs. A preliminary implementation has been developed in $\mathbb{ASP-PROLOG}$.

[1]  Ehud Y. Shapiro,et al.  Algorithmic program diagnosis , 1982, POPL '82.

[2]  Manuel V. Hermenegildo,et al.  A Framework for Assertion-Based Debugging in Constraint Logic Programming , 1998, CP.

[3]  Stefania Costantini,et al.  On the equivalence and range of applicability of graph-based representations of logic programs , 2002, Inf. Process. Lett..

[4]  Manuel V. Hermenegildo,et al.  Combined Static and Dynamic Assertion-Based Debugging of Constraint Logic Programs , 1999, LOPSTR.

[5]  Enrico Pontelli,et al.  ASP-PROLOG: a system for reasoning about answer set programs in prolog , 2004, NMR.

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

[7]  Krzysztof R. Apt,et al.  Logic Programming and Negation: A Survey , 1994, The Journal of Logic Programming.

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

[9]  C. R. Ramakrishnan,et al.  Justifying proofs using memo tables , 2000, PPDP '00.

[10]  Mireille Ducassé,et al.  Opium: An Extendable Trace Analyzer for Prolog , 1999, J. Log. Program..

[11]  Chitta Baral,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .

[12]  Enrico Giunchiglia,et al.  On the Relation Between Answer Set and SAT Procedures (or, Between cmodels and smodels) , 2005, ICLP.

[13]  Mireille Ducassé,et al.  Generating Deductive Database Explanations , 1999, ICLP.

[14]  Giridhar Pemmasani,et al.  Online Justification for Tabled Logic Programs , 2004, FLOPS.

[15]  Jürgen Dix,et al.  Transformation-based bottom-up computation of the well-founded model , 1996, Theory and Practice of Logic Programming.

[16]  Georg Gottlob,et al.  The DLV System , 2002, JELIA.

[17]  Martin Gebser,et al.  The nomore++ Approach to Answer Set Solving , 2005, LPAR.