How Incomplete is Your Semantic Web Reasoner?

AAAI(2010)

引用 0|浏览651
暂无评分
摘要
Conjunctive query answering is a key reasoning service for many ontology-based applications. In order to improve scalability, many Semantic Web query answering systems give up completeness (i.e., they do not guarantee to return all query answers). It may be useful or even critical to the designers and users of such systems to understand how much and what kind of information is (potentially) being lost. We present a method for generating test data that can be used to provide at least partial answers to these questions, a purpose for which existing benchmarks are not well suited. In addition to devel- oping a general framework that formalises the problem, we describe practical data generation algorithms for some pop- ular ontology languages, and present some very encouraging results from our preliminary evaluation.
更多
查看译文
关键词
evaluation,ontologies,semantic web,conjunctive queries,generic algorithm,completeness
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要