Some classes of Prolog programs inferable from positive data
From MaRDI portal
Publication:1575466
DOI10.1016/S0304-3975(99)00271-6zbMath0944.68015MaRDI QIDQ1575466
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (2)
Some classes of term rewriting systems inferable from positive data ⋮ Developments from enquiries into the learnability of the pattern languages from positive data
Cites Work
- Inductive inference of monotonic formal systems from positive data
- Termination proofs for logic programs
- Reasoning about termination of pure Prolog programs
- A class of prolog programs inferable from positive data
- Inductive inference of formal languages from positive data
- Toward a mathematical theory of inductive inference
- Inductive Logic Programming: Theory and methods
- Language identification in the limit
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Some classes of Prolog programs inferable from positive data