The following pages link to (Q3718124):
Displaying 42 items.
- ILP turns 20. Biography and future challenges (Q439010) (← links)
- Proving completeness of logic programs with the cut (Q511027) (← links)
- Declarative error diagnosis (Q578894) (← links)
- Compiling a default reasoning system into Prolog (Q750134) (← links)
- MAT learners for tree series: an abstract data type and two realizations (Q766165) (← links)
- Plausible inferences and plausible reasoning (Q805605) (← links)
- On the connection between the phase transition of the covering test and the learning success rate in ILP (Q1009240) (← links)
- Structured machine learning: the next ten years (Q1009285) (← links)
- S-semantics for logic programming: a retrospective look (Q1035702) (← links)
- Knowledge base refinement: A bibliography (Q1183377) (← links)
- An operational formal definition of PROLOG: A specification method and its application (Q1186100) (← links)
- First-order \(jk\)-clausal theories are PAC-learnable (Q1342231) (← links)
- The learnability of description logics with equality constraints (Q1342732) (← links)
- Most specific logic programs (Q1356224) (← links)
- A theory of formal synthesis via inductive learning (Q1674868) (← links)
- Toward effective knowledge acquisition with first-order logic induction. (Q1850683) (← links)
- Learning closed Horn expressions (Q1854564) (← links)
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification (Q1945017) (← links)
- Using the bottom clause and mode declarations in FOL theory revision from examples (Q1959495) (← links)
- Learning programs by learning from failures (Q2051282) (← links)
- Meta-interpretive learning as metarule specialisation (Q2102414) (← links)
- Slicing concurrent constraint programs (Q2409727) (← links)
- Learning efficient logic programs (Q2425246) (← links)
- Online probabilistic theory revision from examples with ProPPR (Q2425252) (← links)
- A Complete Declarative Debugger for Maude (Q3067479) (← links)
- Declarative Debugging of Rewriting Logic Specifications (Q3184739) (← links)
- Design and implementation of a tracer driver: Easy and efficient dynamic analyses of constraint logic programs (Q3546038) (← links)
- Regular prefix relations (Q3763605) (← links)
- Inductive synthesis of dot expressions (Q4560354) (← links)
- Functional Logic Programming: From Theory to Curry (Q4916076) (← links)
- A backward slicing algorithm for Prolog (Q5030202) (← links)
- The Prolog Debugger and Declarative Programming (Q5097636) (← links)
- A Declarative Debugger for Maude Functional Modules (Q5179130) (← links)
- Answering the “why” in answer set programming – A survey of explanation approaches (Q5197747) (← links)
- Correctness and Completeness of Logic Programs (Q5277919) (← links)
- Debugging for Model Expansion (Q5325763) (← links)
- A Theoretical Framework for the Declarative Debugging of Datalog Programs (Q5504584) (← links)
- A Generalized Model for Algorithmic Debugging (Q5743598) (← links)
- Inductive logic programming (Q5895240) (← links)
- Learning logic programs by explaining their failures (Q6053808) (← links)
- On Correctness and Completeness of an <i>n</i> Queens Program (Q6063871) (← links)
- Tree-Based Generation of Restricted Graph Languages (Q6195089) (← links)
