𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Model transformation by example using inductive logic programming

✍ Scribed by Zoltán Balogh; Dániel Varró

Publisher
Springer-Verlag
Year
2008
Tongue
English
Weight
781 KB
Volume
8
Category
Article
ISSN
1619-1366

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Induction of logic programs by example-g
Induction of logic programs by example-guided unfolding
✍ Henrik Boström; Peter Idestam-Almquist 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 394 KB

Resolution has been used as a specialisation operator in several approaches to top-down induction of logic programs. This operator allows the overly general hypothesis to be used as a declarative bias that restricts not only what predicate symbols can be used in produced hypotheses, but also how the

ChemInform Abstract: Scaffold Hopping in
ChemInform Abstract: Scaffold Hopping in Drug Discovery Using Inductive Logic Programming.
✍ Kazuhisa Tsunoyama; Ata Amini; Michael J. E. Sternberg; Stephen H. Muggleton 📂 Article 📅 2008 🏛 John Wiley and Sons ⚖ 15 KB 👁 1 views

## Abstract ChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 200 leading journals. To access a ChemInform Abstract of an article which was published elsewhere, please select a “Full Text” option. The original article is trackable v

Microarray data classification using ind
Microarray data classification using inductive logic programming and gene ontology background information
✍ Einar Ryeng; Bjørn Kåre Alsberg 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 359 KB

## Abstract There exists many databases containing information on genes that are useful for background information in machine learning analysis of microarray data. The gene ontology and gene ontology annotation projects are among the most comprehensive of these. We demonstrate how inductive logic p

Completing open logic programs by constr
Completing open logic programs by constructive induction
✍ Esra Erdem; Pierre Flener 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB

We consider part of the problem of schema-biased inductive synthesis of recursive logic Ž programs from incomplete specifications, such as clausal evidence for instance, but not . necessarily, ground positive and negative examples . After synthesizing the base clause Ž . and introducing recursive ca