scientific article
From MaRDI portal
Publication:3718124
zbMath0589.68003MaRDI QIDQ3718124
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
semanticsprogram synthesisprogram debuggingautomatic debuggingautomatic program constructionmodel inference systemPROGLOG
Specification and verification (program logics, model checking, etc.) (68Q60) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01)
Related Items
Correctness and Completeness of Logic Programs, First-order \(jk\)-clausal theories are PAC-learnable, The learnability of description logics with equality constraints, Most specific logic programs, Declarative Debugging of Rewriting Logic Specifications, Inductive synthesis of dot expressions, Debugging for Model Expansion, A theory of formal synthesis via inductive learning, Slicing concurrent constraint programs, The Prolog Debugger and Declarative Programming, Regular prefix relations, 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, Learning efficient logic programs, Online probabilistic theory revision from examples with ProPPR, Learning figures with the Hausdorff metric by fractals -- towards computable binary classification, Tree-Based Generation of Restricted Graph Languages, ILP turns 20. Biography and future challenges, Using the bottom clause and mode declarations in FOL theory revision from examples, Design and implementation of a tracer driver: Easy and efficient dynamic analyses of constraint logic programs, Inductive logic programming, Knowledge base refinement: A bibliography, An operational formal definition of PROLOG: A specification method and its application, Proving completeness of logic programs with the cut, Functional Logic Programming: From Theory to Curry, A Generalized Model for Algorithmic Debugging, A Declarative Debugger for Maude Functional Modules, Declarative error diagnosis, Answering the “why” in answer set programming – A survey of explanation approaches, A Complete Declarative Debugger for Maude, 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, Learning programs by learning from failures, Compiling a default reasoning system into Prolog, MAT learners for tree series: an abstract data type and two realizations, S-semantics for logic programming: a retrospective look, A Theoretical Framework for the Declarative Debugging of Datalog Programs, Toward effective knowledge acquisition with first-order logic induction., Learning closed Horn expressions, Meta-interpretive learning as metarule specialisation, Plausible inferences and plausible reasoning, A backward slicing algorithm for Prolog
