ACM Home Page
Please provide us with feedback. Feedback
Justification and debugging of answer set programs in ASP
Full text PdfPdf (280 KB)
Source Proceedings of the sixth international symposium on Automated analysis-driven debugging table of contents
Monterey, California, USA
Pages: 49 - 58  
Year of Publication: 2005
ISBN:1-59593-050-7
Authors
Omar El-Khatib  New Mexico State University
Enrico Pontelli  New Mexico State University
Tran Cao Son  New Mexico State University
Sponsors
ACM: Association for Computing Machinery
SIGSOFT: ACM Special Interest Group on Software Engineering
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 34,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1085130.1085137
What is a DOI?

ABSTRACT

The paper extends the concept of justification to the context of Answer Set Programming---a recent paradigm that builds on the foundations of logic programming, answer set semantics, and non-monotonic reasoning. A justification describes the support for the truth value of each atom in an answer set of a logic program, and it can be employed as a tool for reasoning and debugging of answer set programs. The paper describes the implementation of the notion of justification in the ASP system along with some examples of its applications.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
J. Boye et al. Declarative Diagnosis of Constraint Programs. AADEBUG, 1997.
 
3
 
4
 
5
W. Drabent. The Use of Assertions in Algorithmic Debugging. FGCS, 1988.
 
6
 
7
O. Elkhatib et al. A System for Reasoning about ASP in Prolog. PADL, Springer, 2004.
 
8
 
9
M. Gelfond and V. Lifschitz. The Stable Model Semantics for Logic Programs. JICSLP, MIT, 1988.
 
10
 
11
M. Hermenegildo et al. The CIAO Multi-Dialect Compiler and System. Parallelism and Implementation of Logic Programming, Nova Science, 1999.
 
12
 
13
L. Langevine et al. A Propagation Tracer for GNU-Prolog. ICLP, Springer Verlag, 2003.
 
14
 
15
V.W. Marek and M. Truszczyński. Stable Models and an Alternative Logic Programming Paradigm. The Logic Programming Paradigm. Springer Verlag, 1999.
 
16
L. Naish et al. The NU-Prolog Debugging Environment. ICLP, pages 521--536, 1989.
 
17
 
18
G. Pemmasani et al. Online Justification for Tabled Logic Programs. FLOPS, Springer Verlag, 2004.
19
20
21
 
22
T. Syrjänen. Lparse User's Manual. http://www.tcs.hut.fi/Software/smodels/.
 
23
J.L. Yuh and N. Dershowitz. Debugging Logic Programs using Specifications. AADEBUG, 1993.


Collaborative Colleagues:
Omar El-Khatib: colleagues
Enrico Pontelli: colleagues
Tran Cao Son: colleagues