PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

A refinement operator for inducing Description Logics
Angelos Charalambidis and Stasinos Konstantopoulos
In: 22nd International Conference on Inductive Logic Programming, 17-19 Sep 2012, Dubrovnik, Croatia.

Abstract

We present a new refinement operator that guides an ILP search through a lattice of a Horn clause representation of Description Logic (DL) clauses. Our operator dramatically narrows the search space by being aware of syntactic restrictions on the Horn representation stemming from both the syntax and semantics of DLs as well as from axioms present in the specific background of each experiment.

PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:8423
Deposited By:Stasinos Konstantopoulos
Deposited On:24 October 2012