A framework for theory refinement is presented pursuing the efficiency and
effectiveness of learning regarded as a search process. A refinement operat
or satisfying these requirements is formally defined as ideal. Past results
have demonstrated the impossibility of specifying ideal operators in searc
h 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 nov
el generalization model, named OI-implication, is derived and we prove that
ideal operators can be defined for the resulting search space.