Justifications for Logic Programs under Answer Set Semantics

Simple item page
dc.creatorPontelli, Enrico
dc.creatorSon, Tran Cao
dc.creatorElkhatib, Omar
dc.date2008-12-03
dc.date.accessioned2026-07-07T12:09:04Z
dc.date.available2026-07-07T12:09:04Z
dc.descriptionThe 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))
dc.description59 pages, 7 figures
dc.identifierhttps://arxiv.org/abs/0812.0790
dc.identifierhttp://arxiv.org/abs/0812.0790
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/209505
dc.subjectArtificial Intelligence
dc.subjectProgramming Languages
dc.titleJustifications for Logic Programs under Answer Set Semantics
dc.typetext

Files

Collections

arXiv