Tytuł artykułu
Autorzy
Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
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 q-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.
Wydawca
Czasopismo
Rocznik
Tom
Strony
15--33
Opis fizyczny
bibliogr. 26 poz.
Twórcy
autor
autor
autor
autor
- Dipartimento di Informatica, Universita degli Studi di Bari, Via E. Orabona, 4 I-70125 Bari, Italy, (esposito,fanizzi,ferilli,semeraro)@di.uniba.itfanizzi,ferilli,semeraro)@di.uniba.it
Bibliografia
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS2-0003-0054