III: Small: TROn - Tractable Reasoning with Ontologies

III：小：TROn - 使用本体进行易处理的推理

• 批准号: 1017225
• 负责人: Pascal Hitzler
• 金额: $ 44.92万
• 依托单位: Wright State University
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2010
• 资助国家: 美国
• 起止时间: 2010-09-01 至 2017-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1017225&HistoricalAwards=false
• 关键词: III; Small; TROn; Tractable; Reasoning

The Semantic Web is based on describing the meaning ? orsemantics ? of data on the Web by means of metadata ? data describingother data ? in the form of ontologies. The World Wide Web Consortium(W3C) has made several recommended standards for ontology languageswhich differ in expressivity and ease of use. Central to theselanguages is that they come with a formal semantics, expressed inmodel-theoretic terms, which enables access to implicit knowledge byautomated reasoning.Progress in the adoption of reasoning for ontology languages inpractice is currently being made, but several obstacles remain to beovercome for wide adoption on the Web. Two of the central technicalissues are scalability of reasoning algorithms, and dealing withinconsistency of the ontological knowledge bases. These two issuesare being addressed in this project.The scalability issue has its origin in the fact that the expressionof complex knowledge requires sophisticated ontology languages, likethe Web Ontology Language OWL, which are inherently difficult toreason with ? as witnessed by high computational complexities, usuallyExpTime or beyond. This project builds on recent new developments in polynomial time languages around OWL in order to remedy this. In particular, in this project efficient algorithmizations and tools are developed for the largest currently known polynomial-time ontology language, called ELP. Reasoning with knowledge bases with expressivity beyond ELP isenabled through approximating these knowledge bases within ELP.The inconsistency issue has its origin in the fact that large knowledgebases, in particular on the web, are usually not centrally engineered,but arise out of the merging of different knowledge bases withdifferent underlying perspectives and rationales. In this project tools are developed for efficient, i.e., polynomial-time reasoning with inconsistent ontologies.The concrete outcome of the project is an open source reasoningsystem which is able to reason efficiently with (possibly)inconsistent knowledge bases around OWL, in at least an approximatemanner. For further information see the project web page at http://knoesis.wright.edu/faculty/pascal/projects/tron.html

语义网是建立在描述意义的基础上的。orsemantics吗?通过元数据在网络上的数据？数据描述数据？以本体论的形式。万维网联盟（W3C）已经为本体语言制定了几个推荐的标准，这些标准在表达性和易用性方面有所不同。这些语言的核心是它们具有正式的语义，用模型理论术语表示，这使得通过自动推理可以访问隐性知识。在实践中，本体语言推理的采用正在取得进展，但要在Web上广泛采用，仍有几个障碍需要克服。两个中央technicalissues可伸缩性的推理算法,和解决withinconsistency本体论知识库。这两个问题正在这个项目中得到解决。可扩展性问题源于这样一个事实，即复杂知识的表达需要复杂的本体语言，比如Web本体语言OWL，而这种语言本身就很难进行推理。正如高计算复杂性所证明的那样，通常是exptime或更长时间。为了解决这个问题，这个项目建立在最近围绕OWL的多项式时间语言的新发展之上。特别是,在这个项目中有效的算法化和工具开发最大的目前已知多项式时间本体语言,称为ELP。推理与知识库表达能力超出ELP isenabled ELP内通过近似这些知识库。不一致问题有它的起源在大型知识库,特别是在网络上,通常是不集中改造,但出现的合并不同的知识库withdifferent根本观点和依据。在这个项目中，开发了高效的工具，即不一致本体的多项式时间推理。该项目的具体成果是一个开源推理系统，它能够以至少近似的方式对OWL周围（可能）不一致的知识库进行有效的推理。欲了解更多信息，请参阅该项目的网页http://knoesis.wright.edu/faculty/pascal/projects/tron.html