scientific article; zbMATH DE number 3947593
From MaRDI portal
Publication:3718124
zbMATH Open0589.68003MaRDI QIDQ3718124FDOQ3718124
Authors: Ehud Shapiro 
Publication date: 1984
Title of this publication is not available (Why is that?)
Recommendations
semanticsprogram debuggingprogram synthesisautomatic debuggingautomatic program constructionmodel inference systemPROGLOG
Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (54)
- Structured machine learning: the next ten years
- MAT learners for tree series: an abstract data type and two realizations
- Compiling a default reasoning system into Prolog
- Learning efficient logic programs
- Debugging for Model Expansion
- Title not available (Why is that?)
- The learnability of description logics with equality constraints
- Inductive constraint logic
- Inductive synthesis of dot expressions
- Correctness and completeness of logic programs
- An operational formal definition of PROLOG: A specification method and its application
- A backward slicing algorithm for Prolog
- Most specific logic programs
- Language learning from membership queries and characteristic examples
- A Theoretical Framework for the Declarative Debugging of Datalog Programs
- A theory of formal synthesis via inductive learning
- Learning logic programs by explaining their failures
- Declarative Debugging of Rewriting Logic Specifications
- IDT: integrated system for debugging and testing Prolog programs
- First-order \(jk\)-clausal theories are PAC-learnable
- EDUCATIONAL PEARL: ‘Proof-directed debugging’ revisited for a first-order version
- On correctness of normal logic programs
- Title not available (Why is that?)
- The Prolog debugger and declarative programming
- Automatic Binding-Related Error Diagnosis in Logic Programs
- Inductive logic programming
- Algorithmic debugging generalized
- On the connection between the phase transition of the covering test and the learning success rate in ILP
- On Correctness and Completeness of an n Queens Program
- Learning closed Horn expressions
- Title not available (Why is that?)
- Declarative error diagnosis
- A procedure to debug computer programs
- Tree-Based Generation of Restricted Graph Languages
- A complete declarative debugger for Maude
- Design and implementation of a tracer driver: Easy and efficient dynamic analyses of constraint logic programs
- A generalized model for algorithmic debugging
- S-semantics for logic programming: a retrospective look
- Learning programs by learning from failures
- Answering the ``why in answer set programming -- a survey of explanation approaches
- Meta-interpretive learning as metarule specialisation
- Knowledge base refinement: A bibliography
- A declarative debugger for Maude functional modules
- 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
- Incremental learning of logic programs
- Proving completeness of logic programs with the cut
- Regular prefix relations
- Debugging tools for a system with automatic program synthesis
- Plausible inferences and plausible reasoning
- Functional Logic Programming: From Theory to Curry
- ILP turns 20. Biography and future challenges
- Online probabilistic theory revision from examples with ProPPR
- Toward effective knowledge acquisition with first-order logic induction.
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)
