RDFS with Attribute Equations via SPARQL Rewriting
RDFS with Attribute Equations via SPARQL Rewriting
复制标题
通过 SPARQL 重写具有属性方程的 RDFS
DOI：
--
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
A. Polleres
中科院分区：
文献类型：
--
作者：
Stefan Bischof;A. Polleres
除了关于通常可以用RDFS和OWL等语言表示的概念和属性的分类知识之外，RDF图中的隐式信息同样可以由算术方程确定。这里的主要用例是利用可通过这些方程表示的数值属性之间的函数依赖关系的知识。虽然其中一些知识可以编码为本体语言的规则扩展，但我们提供了一个更灵活的框架，将属性方程视为本体语言中的头等公民。本体推理和属性方程的结合是通过扩展查询重写技术来实现的，这些技术已经分别成功地应用于RDFS或OWL等本体语言。我们部署这种技术用于重写SPARQL查询，并讨论替代实现的可行性，例如基于规则的方法。
In addition to taxonomic knowledge about concepts and properties typically expressible in languages such as RDFS and OWL, implicit information in an RDF graph may be likewise determined by arithmetic equations. The main use case here is exploiting knowledge about functional dependencies among numerical attributes expressible by means of such equations. While some of this knowledge can be encoded in rule extensions to ontology languages, we provide an arguably more flexible framework that treats attribute equations as first class citizens in the ontology language. The combination of ontological reasoning and attribute equations is realized by extending query rewriting techniques already successfully applied for ontology languages such as (the DL-Lite-fragment of) RDFS or OWL, respectively. We deploy this technique for rewriting SPARQL queries and discuss the feasibility of alternative implementations, such as rule-based approaches.