FI:I043 Inductive Logic Programming

I043 Inductive Logic Programming

Faculty of Informatics
Spring 1998

Extent and Intensity

0/2. 2 credit(s). Recommended Type of Completion: k (colloquium). Other types of completion: z (credit).

Teacher(s)

doc. RNDr. Lubomír Popelínský, Ph.D. (lecturer)

Guaranteed by

Contact Person: doc. RNDr. Lubomír Popelínský, Ph.D.

Prerequisites (in Czech)

Předpokládá se znalost jazyka Prolog.

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

Syllabus

This course brings together the most important disocveries of inductive inference methods in the first order logic. As a part of that it is a project. Experience with Prolog is assumed.
Theory of inductive inference: identification in limit, identification by enumeration, other models of learning.
Introduction to inductive learning: operators of generalization and of specialization. Basic algorithms.
Inductive inference in the first order logic: inductive logic programmin(ILP), basic task of ILP, Gencon.
Top-down ILP: refinement operators and refinement trees. MIS
Interactive ILP: Queries and oracles, their types. WiM
Inductive inference and logic program synthesis: Recursive program synthesis, schema-based synthesis, SYNAPSE, DIALOGS. Synthesis by analysis of computation trace.
Empirical ILP. GOLEM,FOIL.Progol.
Complexity of ILP algorithms: PAC-learnability, PAC-learnable classes. Other models of learnability.
Applications of ILP. IILP and databases.

Language of instruction

Czech

The course is also listed under the following terms Autumn 1998, Autumn 2000, Autumn 2001.