可靠、完全和最小的UCQ-潜在规则重写
Sound, Complete and Minimal UCQ-Rewriting for Existential Rules
摘要：
我们解决基于本体的数据访问的问题，与本体表示的存在规则的框架，也被称为数据库+/-。一种公知的方法涉及使用本体知识重写查询。在这里，我们专注于基本的重写技术，其中包括重写成一个联盟的合取查询的初始查询。首先，我们研究了一个通用的宽度优先重写算法，它需要作为输入的任何重写操作，并定义属性的重写操作，以确保算法的正确性。然后，我们专注于片统一，它提供了一个重写操作所需的属性。最后，我们提出了这个框架的实现，并报告了一些实验。
英文摘要：
We address the issue of Ontology-Based Data Access, with ontologies represented in the framework of existential rules, also known as Datalog+/-. A well-known approach involves rewriting the query using ontological knowledge. We focus here on the basic rewriting technique which consists of rewriting the initial query into a union of conjunctive queries. First, we study a generic breadth-first rewriting algorithm, which takes as input any rewriting operator, and define properties of rewriting operators that ensure the correctness of the algorithm. Then, we focus on piece-unifiers, which provide a rewriting operator with the desired properties. Finally, we propose an implementation of this framework and report some experiments.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
