Some classes of Prolog programs inferable from positive data
From MaRDI portal
Recommendations
Cites work
- A class of Prolog programs inferable from positive data
- scientific article; zbMATH DE number 996385 (Why is no real title available?)
- scientific article; zbMATH DE number 458994 (Why is no real title available?)
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 408771 (Why is no real title available?)
- scientific article; zbMATH DE number 1351100 (Why is no real title available?)
- scientific article; zbMATH DE number 1149414 (Why is no real title available?)
- scientific article; zbMATH DE number 788036 (Why is no real title available?)
- Inductive inference of formal languages from positive data
- Inductive inference of monotonic formal systems from positive data
- Inductive Logic Programming: Theory and methods
- Language identification in the limit
- Reasoning about termination of pure Prolog programs
- Termination proofs for logic programs
- Toward a mathematical theory of inductive inference
Cited in
(8)- Rich classes inferable from positive data: Length-bounded elementary formal systems
- A class of Prolog programs inferable from positive data
- Representative sample of LISP program inference from examples
- Algorithmic Learning Theory
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
- Algorithmic Learning Theory
- Some classes of term rewriting systems inferable from positive data
- Developments from enquiries into the learnability of the pattern languages from positive data
This page was built for publication: Some classes of Prolog programs inferable from positive data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575466)
