图 书 馆
基于SPARQL重写的属性方程RDFSRDFS with Attribute Equations via SPARQL Rewriting |
|
| 课程网址: | http://videolectures.net/eswc2013_bischof_sparql_rewriting/ |
| 主讲教师: | Stefan Bischof |
| 开课单位: | 西门子公司 |
| 开课时间: | 2013-07-08 |
| 课程语种: | 英语 |
| 中文简介: |  除了有关通常可在诸如RDFS和OWL之类的语言中表达的概念和特性的分类学知识外，RDF图中的隐式信息也可以由算术方程式确定。这里的主要用例是利用关于可通过此类方程式表达的数值属性之间的函数依赖性的知识。尽管可以将这些知识中的一些编码为本体语言的规则扩展，但我们提供了一个可以说更灵活的框架，该框架将属性方程式视为本体语言中的一等公民。本体推理和属性方程的组合是通过扩展已经成功应用于本体语言（例如RDFS或DLFS的DL Lite片段）的查询重写技术来实现的。我们将这种技术用于重写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 uccessfully 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. |
| 关 键 词: | 编码; 算术方程式 |
| 课程来源: | 视频讲座网 |
| 数据采集: | 2021-03-24：zyk |
| 最后编审: | 2021-05-14：yumf |
| 阅读次数: | 35 |