Open Access
Algorithmic Debugging with Assertions.
Wlodzimierz Drabent,Simin Nadjm-Tehrani,Jan Maluszynski +2 more
- 01 Jan 1988
pp 501-521
66
TL;DR: In this article, a generalization of the Prolog language used to communicate with the debugger is presented, where formal specifications of some properties of the intended model are allowed, in addition to the usual “yes” and “no” answers.
read more
Abstract: Algorithmic debugging, as presented by Shapiro, is an interactive process where the debugging system acquires knowledge about the expected meaning of a program being debugged and uses it to localize errors. This paper suggests a generalization of the language used to communicate with the debugger. In addition to the usual “yes” and “no” answers, formal specifications of some properties of the intended model are allowed. The specifications are logic programs. They employ library procedures and are developed interactively in the debugging process. An experimental debugging system incorporating this idea has been implemented. In contrast to some other systems, its diagnosis algorithms do not require instantiation of unsolved goals by the oracle. This is achieved by generalization of the oracle in the incorrectness algorithm, and by adopting a new approach in the insufficiency algorithm. A formal proof of correctness and completeness of the new insufficiency algorithm is presented. Extensions for some Prolog features are discussed.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Dissertation
Debugging and repair of owl ontologies
James A. Hendler,Aditya Kalyanpur +1 more
- 01 Jan 2006
TL;DR: This thesis presents a complete end-to-end framework for explaining, pinpointing and repairing semantic defects in OWL-DL ontologies (or in other words, SHOIN a knowledge base), which demonstrates its practical use and significance for OWL ontology modelers and users.
221
On the Role of Semantic Approximations on Validation and Diagnosis of Contraint Logic Programs
Francisco Bueno,Pierre Deransart,Wlodzimierz Drabent,Gérard Ferrand,Manuel V. Hermenegildo,Jan Maluszynski,Germán Puebla +6 more
- 10 Sep 1997
TL;DR: In this article, the problem of proving completeness and incompleteness with respect to the abstract interpretation of a program is addressed using a Galois insertion (Galois insertion +; +).
90
Inductive synthesis of recursive logic programs: Achievements and prospects
Pierre Flener,Serap Yıilmaz +1 more
TL;DR: Past and present achievements are overviewed, focusing on the techniques that were designed specifically for the inductive synthesis of recursive logic programs but also discussing a few general ILP techniques that can also induce non-recursive hypotheses.
66
Declarative diagnosis of missing answers
TL;DR: Algorithms for declarative diagnosis of missing answers in Prolog programs, especially programs which use coroutines are investigated, and possible ways to adapt these algorithms to handle coroutining are discussed.
47
Declarative Diagnosis in the CLP Scheme
Alexandre Tessier,Gérard Ferrand +1 more
- 01 Jan 2000
TL;DR: Symptom and error are connected via some kind of tree and the diagnosis amounts to search for a kind of minimal symptom in this tree, that is a limited program fragment responsible for the symptom.
43
References
•Book
Algorithmic Program Debugging
Ehud Shapiro
- 14 Apr 1983
TL;DR: An algorithm that can fix a bug that has been identified, and integrate it with the diagnosis algorithms to form an interactive debugging system that can debug programs that are too complex for the Model Inference System to synthesize.
1.2K
•Journal Article
The Use of Assertions in Algorithmic Debugging.
52
•Proceedings Article
A Framework for Prolog Debugging.
Luís Moniz Pereira,Miguel Calejo +1 more
- 01 Jan 1988
TL;DR: A new framework is set forth, the “Select&Query” algorithm schema, which provides a uniform treatment for more error types and a larger Prolog subset, including programs with comitments and meta-logical predicates, though not side-effects.
33