We present a framework for theory refinement operators ful- filling properties that ensure the efficiency and effectiveness of the learning process. A refinement operator satisfying these requirements is de- fined ideal. Past results have demonstrated the impossibility of defining ideal operators in search spaces ordered by the logical implication or the θ-subsumption relationships. By assuming the object identity bias over a space defined by a clausal language ordered by logical implication, we obtain OI-implication, a novel ordering relationship, and show that ideal operators can be defined for the resulting search space.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
Titolo: | Refining Logic Theories under OI-Implication |
Autori: | |
Data di pubblicazione: | 2000 |
Rivista: | |
Abstract: | We present a framework for theory refinement operators ful- filling properties that ensure the efficiency and effectiveness of the learning process. A refinement operator satisfying these requirements is de- fined ideal. Past results have demonstrated the impossibility of defining ideal operators in search spaces ordered by the logical implication or the θ-subsumption relationships. By assuming the object identity bias over a space defined by a clausal language ordered by logical implication, we obtain OI-implication, a novel ordering relationship, and show that ideal operators can be defined for the resulting search space. |
Handle: | http://hdl.handle.net/11586/112500 |
ISBN: | 3-540-41094-5 |
Appare nelle tipologie: | 2.1 Contributo in volume (Capitolo o Saggio) |