Finding Unexplainable Triples in an RDF Graph
[ 1 ] Instytut Informatyki, Wydział Informatyki, Politechnika Poznańska | [ P ] pracownik
2018
rozdział w monografii naukowej / referat
angielski
- ontology learning
- explanation
- RDF
- OWL 2 RL
EN 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
inne
20
140
WoS (15)