Predicate invention and utilization
- 1 January 1994
- journal article
- research article
- Published by Taylor & Francis in Journal of Experimental & Theoretical Artificial Intelligence
- Vol. 6 (1) , 121-130
- https://doi.org/10.1080/09528139408953784
Abstract
Inductive logic programming (ILP) involves the synthesis of logic programs from examples. In terms of scientific theory formation ILP systems define observational predicates in terms of a set of theoretical predicates. However, certain basic theorems indicate that with an inadequate theoretical vocabulary this is not always possible. Predicate invention is the augmentation of a given theoretical vocabulary to allow finite axiomatization of the observational predicates. New theoretical predicates need to be chosen from a well-defined universe of such predicates. In this paper a partial order of utilization is described over such a universe. This ordering is a special case of a logical translation. The notion of utilization allows the definition of an equivalence relationship over new predicates. In a manner analogous to Plotkin, clause refinement is defined relative to given background knowledge and a universe of new predicates. It is shown that relative least clause refinement is defined and unique whenever there exists a relative least general generalization of a set of clauses. Results of a preliminary implementation of this approach are given.Keywords
This publication has 5 references indexed in Scilit:
- Protein secondary structure prediction using logic-based machine learningProtein Engineering, Design and Selection, 1992
- Inductive logic programmingNew Generation Computing, 1991
- Foundations of Logic ProgrammingPublished by Springer Nature ,1984
- Algorithmic Program DebuggingPublished by MIT Press ,1983
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965