Justifications for Logic Programs under Answer Set Semantics

2008/12/03 by Enrico Pontelli, Pontelli, Enrico, Tran Cao Son +2
Computer Science · #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #Logic, Reasoning, and Knowledge #Multi-Agent Systems and Negotiation #Programming Languages (cs.PL) #Semantic Web and Ontologies

paper · pdf · doi:10.48550/arxiv.0812.0790

openalex publication_date 2008/12/03 · openalex created_date 2017/02/10 · openalex updated_date 2026/07/28

Abstract

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 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. Off-line and on-line justifications provide useful tools to enhance understanding of ASP, and they offer a basic data structure to support methodologies and tools for debugging answer set programs. A preliminary implementation has been developed in ASP-PROLOG. (To appear in Theory and Practice of Logic Programming (TPLP))

Related

• Generating explanations for answer set programming applications
• Historical Review of Variants of Informal Semantics for Logic Programs under Answer Set Semantics: GL'88, GL'91, GK'14, D-V'12
• Answering the "why" in Answer Set Programming - A Survey of Explanation\n Approaches
• Automated verification of weak equivalence within the SMODELS system
• Answer Set Programming Made Easy