Induction of logical relations based on specific generalization of strings


Creative Commons License

Uzun Y., Cicekli I.

22nd International Symposium on Computer and Information Sciences, Ankara, Türkiye, 7 - 09 Kasım 2007, ss.162-167 identifier identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Doi Numarası: 10.1109/iscis.2007.4456855
  • Basıldığı Şehir: Ankara
  • Basıldığı Ülke: Türkiye
  • Sayfa Sayıları: ss.162-167
  • Hacettepe Üniversitesi Adresli: Hayır

Özet

Learning logical relations from examples expressed as first order facts has been studied extensively by the Inductive Logic Programming research. Learning with positive-only data may cause over generalization of examples leading to inconsistent resulting hypotheses. A learning heuristic inferring specific generalization of strings based on unique match sequences is shown to be capable of learning predicates with string arguments. This paper describes an inductive learner based on the idea of specific generalization of strings, and the given clauses are generalized by considering the background knowledge.