scientific article; zbMATH DE number 3947593
The book describes a very ambitious afford to develop a system for interactive debugging of programs, the methods of which could be extended to cope with problems of automatic program construction from examples. The treatment of the subject is so original and inspiring that the work won the ACM contest for the best doctoral dissertation in computer- related science and engineering in the year 1982. The first chapter discusses the reasons why automatic debugging should be studied and reviews the work done in this field up to the year 1982. Chapter 2 introduces the basic concepts of PROGLOG - the language which was chosen both as the target and implementation language of the project. There are developed the basic diagnosis algorithms (Chapter 3), which allows to discover three types of errors in the programs: termination with incorrect output, termination with missing output and nontermination in pure PROLOG programs. The next chapter presents the problem of program synthesis from examples as special case of program debugging. It carefully explains the model inference system - the author's implementation of an incremental inductive inference algorithm for program synthesis using the methods suggested in former chapter. Chapter 5 is concerned with program debugging under competent programmer assumption trying to find a close variant of the debugged program, which behaves correctly. If the algorithms fails to find such a variant it turns itself to the programmer to make the necessary change. The last chapter reviews the results and suggests directions of further research. The author summarizes those qualities of a programming language which are important for building of a robust debugging system with facilities to reason about considered programs. Simple semantics seems to be one of the basic properties of the target language. This property of PROLOG led to its choice of the target and implementation language of the project. The appendices of the book include listings of PROLOG implementation of all discussed algorithms. The book will be of great interest for anyone concerned with development of new tools for software construction as well as for the whole PROLOG community.
- On the connection between the phase transition of the covering test and the learning success rate in ILP
- Structured machine learning: the next ten years
- S-semantics for logic programming: a retrospective look
- Knowledge base refinement: A bibliography
- An operational formal definition of PROLOG: A specification method and its application
- First-order \(jk\)-clausal theories are PAC-learnable
- The learnability of description logics with equality constraints
- Most specific logic programs
- Algorithmic debugging generalized
- A theory of formal synthesis via inductive learning
- Toward effective knowledge acquisition with first-order logic induction.
- Learning closed Horn expressions
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
- Using the bottom clause and mode declarations in FOL theory revision from examples
- Learning programs by learning from failures
- Meta-interpretive learning as metarule specialisation
- Learning efficient logic programs
- Online probabilistic theory revision from examples with ProPPR
- IDT: integrated system for debugging and testing Prolog programs
- A complete declarative debugger for Maude
- Declarative Debugging of Rewriting Logic Specifications
- scientific article; zbMATH DE number 4211480 (Why is no real title available?)
- EDUCATIONAL PEARL: ‘Proof-directed debugging’ revisited for a first-order version
- Design and implementation of a tracer driver: Easy and efficient dynamic analyses of constraint logic programs
- Automatic Binding-Related Error Diagnosis in Logic Programs
- A procedure to debug computer programs
- Regular prefix relations
- scientific article; zbMATH DE number 4047035 (Why is no real title available?)
- scientific article; zbMATH DE number 43241 (Why is no real title available?)
- scientific article; zbMATH DE number 1235365 (Why is no real title available?)
- ILP turns 20. Biography and future challenges
- Inductive synthesis of dot expressions
- scientific article; zbMATH DE number 194617 (Why is no real title available?)
- scientific article; zbMATH DE number 1870455 (Why is no real title available?)
- Functional Logic Programming: From Theory to Curry
- A backward slicing algorithm for Prolog
- The Prolog debugger and declarative programming
- Proving completeness of logic programs with the cut
- A declarative debugger for Maude functional modules
- Answering the ``why in answer set programming -- a survey of explanation approaches
- Correctness and completeness of logic programs
- Debugging for Model Expansion
- A Theoretical Framework for the Declarative Debugging of Datalog Programs
- A generalized model for algorithmic debugging
- Declarative error diagnosis
- Inductive logic programming
- Learning logic programs by explaining their failures
- Language learning from membership queries and characteristic examples
- Inductive constraint logic
- Incremental learning of logic programs
- On Correctness and Completeness of an n Queens Program
- On correctness of normal logic programs
- Tree-Based Generation of Restricted Graph Languages
- Compiling a default reasoning system into Prolog
- MAT learners for tree series: an abstract data type and two realizations
- Debugging tools for a system with automatic program synthesis
- Plausible inferences and plausible reasoning
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3718124)