Top-down algorithms for relational learning specialize general rules un- til they are consistent , and are guided by heuristics of different kinds.In general, a correct solutiion is not guaranteed. By contrast, bottom-up methods are well formalized, usually within the framework of inverse reso- lution.Inverse resolution has also been used as an efficient tool for deduc- tive reasoning, and here we prove tha 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.
Learning Relations: Basing Top-Down Methods on Inverse Resolution
BERGADANO, Francesco;GUNETTI, Daniele
1993-01-01
Abstract
Top-down algorithms for relational learning specialize general rules un- til they are consistent , and are guided by heuristics of different kinds.In general, a correct solutiion is not guaranteed. By contrast, bottom-up methods are well formalized, usually within the framework of inverse reso- lution.Inverse resolution has also been used as an efficient tool for deduc- tive reasoning, and here we prove tha 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.File | Dimensione | Formato | |
---|---|---|---|
aiia93.pdf
Accesso aperto
Tipo di file:
PREPRINT (PRIMA BOZZA)
Dimensione
162.57 kB
Formato
Adobe PDF
|
162.57 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.