A meta-programming technique for debugging answer-set programs

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2008, Pages 448-453

  Gebser, Martin ^a   Pührer, Jörg ^b   Schaub, Torsten ^a   Tompits, Hans ^b  

^a UNIVERSITY OF POTSDAM   (Germany)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BIONICS; ERRORS; INFORMATION THEORY;

ANSWER SETS; CHARACTERISATION; DEBUGGING SYSTEMS; META PROGRAMMINGS; PRE-REQUISITES; SET PROGRAMMINGS; SET SEMANTICS;

PROGRAM DEBUGGING;

EID: 57749194179     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Baral, C. 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press.
2. Brain, M., and De Vos, M. 2005. Debugging Logic Programs under the Answer-Set Semantics. In Proc. ASP '05, CEUR-WS.org.
3. Brain, M.; Gebser, M.; Pührer, J.; Schaub, T.; Tompits, H.; and Woltran, S. 2007. Debugging ASP Programs by Means of ASP. In Proc. LPNMR'07, 31-43. Springer.
4. Eiter, T., and Polleres, A. 2006. Towards Automated Integration of Guess and Check Programs in Answer-Set Programming: A Meta-Interpreter and Applications. Theory and Practice of Logic Programming 6(1-2):23-60.
5. Ferraris, P.; Lee, J.; and Lifschitz, V. 2006. A Generalization of the Lin-Zhao Theorem. Annals of Mathematics and Artificial Intelligence 47(1-2):79-101.
6. Gebser, M.; Lee, J.; and Lierler, Y. 2006. Elementary Sets for Logic Programs. In Proc. AAAI'06. AAAI Press.
7. Gelfond, M., and Lifschitz, V. 1991. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9(3-4):365-386.
8. Lee, J. 2005. A Model-Theoretic Counterpart of Loop Formulas. In Proc. IJCAI'05, 503-508. Professional Book Center.
9. Leone, N.; Pfeifer, G.; Faber, W.; Eiter, T.; Gottlob, G.; Perri, S.; and Scarcello, F. 2006. The DLV System for Knowledge Representation and Reasoning. ACM Transactions on Computational Logic 7(3):499-562.
10. Mikitiuk, A.; Moseley, E.; and Truszczyński, M. 2007. Towards Debugging of Answer-Set Programs in the Language PSpb. In Proc. ICAI'07, 635-640. CSREA Press.
11. Pontelli, E., and Son, T. C. 2006. Justifications for Logic Programs under Answer Set Semantics. In Proc. ICLP 06, 196-210. Springer.
12. Pührer, J. 2007. On Debugging of Propositional Answer-Set Programs. Master's thesis, Technische Universitat Wien.
13. Reiter, R. 1987. A Theory of Diagnosis from First Principles. Artificial Intelligence 32(1):57-95.
14. Roychoudhury, A.; Ramakrishnan, C. R.; and Ramakrishnan, I. V. 2000. Justifying Proofs Using Memo Tables. In Proc. PPDP'00, 178-189. ACM.
15. Simons, P.; Niemelä, I.; and Soininen, T. 2002. Extending and Implementing the Stable Model Semantics. Artificial Intelligence 138(1): 181-234.
16. Sterling, L., and Shapiro, E. 1994. The Art of PROLOG: Advanced Programming Techniques. MIT Press.
17. Syrjänen, T. 2006. Debugging Inconsistent Answer-Set Programs. In Proc. NMR'06, 77-83.
18. You, J.-H., and Yuan, L. Y. 1994. A Three-Valued Semantics for Deductive Databases and Logic Programs. Journal of Computer and System Sciences 49(2):334-361.