Constructing simply recursive programs from a finite set of good examples (Q293131)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Constructing simply recursive programs from a finite set of good examples |
scientific article; zbMATH DE number 6590639
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructing simply recursive programs from a finite set of good examples |
scientific article; zbMATH DE number 6590639 |
Statements
Constructing simply recursive programs from a finite set of good examples (English)
0 references
9 June 2016
0 references
learning from good examples
0 references
inductive logic programming
0 references
finite identification
0 references
