Finding Unexplainable Triples in an RDF Graph

被引:1
作者
Potoniec, Jedrzej [1 ]
机构
[1] Poznan Univ Tech, Fac Comp, Ul Piotrowo 3, PL-60965 Poznan, Poland
来源
SEMANTIC WEB: ESWC 2018 SATELLITE EVENTS | 2018年 / 11155卷
关键词
Ontology learning; Explanation; RDF; OWL; 2; RL;
D O I
10.1007/978-3-319-98192-5_1
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We consider how to select a subgraph of an RDF graph in an ontology learning problem in order to avoid learning redundant axioms. We propose to address this by selecting RDF triples that can not be inferred using a reasoner and we present an algorithm to find them.
引用
收藏
页码:3 / 7
页数:5
相关论文
共 9 条
  • [1] [Anonymous], 2012, OWL 2 WEB ONTOLOGY L
  • [2] Baader F, 2007, 20TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P230
  • [3] Carothers G, 2014, PRUDHOMMEAUX RDF 1 1
  • [4] DAquin M., 2006, P WOMO 2006, V232
  • [5] Horridge M., 2012, OWL 2 WEB ONT LANG M
  • [6] Toward cognitive support for OWL justifications
    Horridge, Matthew
    Bail, Samantha
    Parsia, Bijan
    Sattler, Uli
    [J]. KNOWLEDGE-BASED SYSTEMS, 2013, 53 : 66 - 79
  • [7] Class expression learning for ontology engineering
    Lehmann, Jens
    Auer, Soeren
    Buehmann, Lorenz
    Tramp, Sebastian
    [J]. JOURNAL OF WEB SEMANTICS, 2011, 9 (01): : 71 - 81
  • [8] Swift Linked Data Miner: Mining OWL 2 EL class expressions directly from online RDF datasets
    Potoniec, Jedrzej
    Jakubowski, Piotr
    Lawrynowicz, Agnieszka
    [J]. JOURNAL OF WEB SEMANTICS, 2017, 46-47 : 31 - 50
  • [9] Seidenberg J., 2006, WWW, P13, DOI DOI 10.1145/1135777.1135785