@inproceedings{00ca6036deea4c1b8104fc75abbd2752,
title = "Debugging by diagnosing assumptions",
abstract = "We present a novel and uniform technique for normal logic program declarative error diagnosis. We lay down the foundations on a general approach to diagnosis using logic programming, and bring out the close relationship between debugging and fault-finding. Diagnostic debugging can be enacted by contradiction removal methods. It relies on a simple program transformation to provide a contradiction removal approach to debugging, based on revising the assumptions about predicates{\textquoteright} correctness and completeness. The contradiction removal method is justified in turn in terms of wellfounded semantics. The loop detection properties of well-founded semantics will allow in the future for a declarative treatment of otherwise endless derivations. The debugging of programs under well-founded semantics with explict negation is also foreseen. Here, we apply our techniques to finite SLDNF derivations, whose meaning coincides with the well-founded model, for which our contradiction removal method and algorithm is sound and complete. Several examples illustrate the algorithm at work.",
author = "Pereira, {Lu{\'i}s Moniz} and Dam{\'a}sio, {Carlos Viegas} and Alferes, {Jos{\'e} J{\'u}lio}",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1993.; 1st International Workshop on Automated and Algorithmic Debugging, AADEBUG 1993 ; Conference date: 03-05-1993 Through 05-05-1993",
year = "1993",
doi = "10.1007/bfb0019400",
language = "English",
isbn = "978-3-540-57417-0",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "59--74",
editor = "Fritzson, {Peter A.}",
booktitle = "Automated and Algorithmic Debugging - 1st International Workshop, AADEBUG 1993, Proceedings",
address = "Netherlands",
}