Building rules on top of ontologies for the Semantic Web with inductive logic programming

被引:16
作者
Lisi, Francesca A. [1 ]
机构
[1] Univ Bari, Dipartimento Informat, I-70125 Bari, Italy
关键词
inductive logic programming; hybrid knowledge representation and reasoning systems; ontologies; semantic web;
D O I
10.1017/S1471068407003195
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Building rules on top of ontologies is the ultimate goal of the logical layer of the Semantic Web. To this aim, an ad-hoc markup language for this layer is currently under discussion. It is intended to follow the tradition of hybrid knowledge representation and reasoning systems, such as,AL-log that integrates the description logic ALC and the function-free Horn clausal language DATALOG. In this paper, we consider the problem of automating the acquisition of these rules for the Semantic Web. We propose a general framework for rule induction that adopts the methodological apparatus of Inductive Logic Programming and relies on the expressive and deductive power of AL-log. The framework is valid whatever the scope of induction (description versus prediction) is. Yet, for illustrative purposes, we also discuss an instantiation of the framework which aims at description and turns out to be useful in Ontology Refinement.
引用
收藏
页码:271 / 300
页数:30
相关论文
共 56 条
[1]  
[Anonymous], 2000, Logic Journal of the IGPL, DOI DOI 10.1093/JIGPAL/8.3.239
[2]  
[Anonymous], ECAI WORKSH ONT LEAR
[3]  
Baader F., 2003, DESCRIPTION LOGIC HD
[4]  
BERNERSLEE T, 2001, SCI AM MAY
[5]   Scaling up inductive logic programming by learning from interpretations [J].
Blockeel, H ;
de Raedt, L ;
Jacobs, N ;
Demoen, B .
DATA MINING AND KNOWLEDGE DISCOVERY, 1999, 3 (01) :59-93
[6]   On the relative expressiveness of description logics and predicate logics [J].
Borgida, A .
ARTIFICIAL INTELLIGENCE, 1996, 82 (1-2) :353-367
[7]   GENERALIZED SUBSUMPTION AND ITS APPLICATIONS TO INDUCTION AND REDUNDANCY [J].
BUNTINE, W .
ARTIFICIAL INTELLIGENCE, 1988, 36 (02) :149-176
[8]  
Ceri Stefano, 1990, Logic Programming and Databases, DOI [10.1007/ 978-3-642-83952-8_6, DOI 10.1007/978-3-642-83952-8_6]
[9]  
Dellschaft K, 2006, LECT NOTES COMPUT SC, V4273, P228
[10]   FIRST-ORDER JK-CLAUSAL THEORIES ARE PAC-LEARNABLE [J].
DERAEDT, L ;
DZEROSKI, S .
ARTIFICIAL INTELLIGENCE, 1994, 70 (1-2) :375-392