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.

Refining Logic Theories under OI-Implication

ESPOSITO, Floriana;FANIZZI, Nicola;FERILLI, Stefano;SEMERARO, Giovanni
2000

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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11586/112500
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact