Learning Relations: Basing Top-Down Methods on Inverse Resolution

Top-down algorithms for relational learning specialize general rules until they are consistent, and are guided by heuristics of different kinds. In general, a correct solution is not guaranteed. By contrast, bottom-up methods are well formalized, usually within the framework of inverse resolution. Inverse resolution has also been used as an efficient tool for deductive reasoning, and here we prove that input refutations can be translated into inverse unit refutations. This result allows us to show that top-down learning methods can be also described by means of inverse resolution, yielding a unified theory of relational learning.

[1]  Stephen Muggleton,et al.  Machine Invention of First Order Predicates by Inverting Resolution , 1988, ML.

[2]  Donald W. Loveland,et al.  Automated theorem proving: a logical basis , 1978, Fundamental studies in computer science.

[3]  Ehud Shapiro,et al.  Algorithmic Program Debugging , 1983 .

[4]  Francesco Bergadano,et al.  Inductive Database Relations , 1993, IEEE Trans. Knowl. Data Eng..

[5]  Efficient proofs in propositional calculus with inverse resolution , 1992, CompEuro 1992 Proceedings Computer Systems and Software Engineering.

[6]  P. Schönemann On artificial intelligence , 1985, Behavioral and Brain Sciences.

[7]  J. R. Quinlan Learning Logical Definitions from Relations , 1990 .

[8]  Francesco Bergadano,et al.  An Interactive System to Learn Functional Logic Programs , 1993, IJCAI.