A framework for theory refinement is presented pursuing the efficiency and effectiveness of learning regarded as a search process. A refinement operator satisfying these requirements is formally defined as ideal. Past results have demonstrated the impossibility of specifying ideal operators in search spaces where standard generalization models, like logical implication or theta -subsumption, are adopted. By assuming the object identity bias over a space defined by a clausal language ordered by logical implication, a novel generalization model, named OI-implication, is derived and we prove that ideal operators can be defined for the resulting search space.
A Generalization Model Based on OI-implication for Ideal Theory Refinement
ESPOSITO, Floriana;FANIZZI, Nicola;FERILLI, Stefano;SEMERARO, Giovanni
2001-01-01
Abstract
A framework for theory refinement is presented pursuing the efficiency and effectiveness of learning regarded as a search process. A refinement operator satisfying these requirements is formally defined as ideal. Past results have demonstrated the impossibility of specifying ideal operators in search spaces where standard generalization models, like logical implication or theta -subsumption, are adopted. By assuming the object identity bias over a space defined by a clausal language ordered by logical implication, a novel generalization model, named OI-implication, is derived and we prove that ideal operators can be defined for the resulting search space.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
