Induction of logical relations based on specific generalization of strings

Yasin Uzun, Ilyas Cicekli

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publication22nd International Symposium on Computer and Information Sciences, ISCIS 2007 - Proceedings
Pages163-168
Number of pages6
DOIs
StatePublished - 2007
Event22nd International Symposium on Computer and Information Sciences, ISCIS 2007 - Ankara, Turkey
Duration: Nov 7 2007Nov 9 2007

Publication series

Name22nd International Symposium on Computer and Information Sciences, ISCIS 2007 - Proceedings

Conference

Conference22nd International Symposium on Computer and Information Sciences, ISCIS 2007
Country/TerritoryTurkey
CityAnkara
Period11/7/0711/9/07

All Science Journal Classification (ASJC) codes

  • General Computer Science
  • Information Systems

Fingerprint

Dive into the research topics of 'Induction of logical relations based on specific generalization of strings'. Together they form a unique fingerprint.

Cite this