论文标题
基于饱和的布尔连接查询回答和重写受保护的量化片段
Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments
论文作者
论文摘要
查询答案是AI，数据库和知识表示的重要问题。在本文中，我们开发了基于饱和的布尔式查询查询答案和重写程序，为受保护的，松散的守卫和驻留的片段。我们的查询答案程序改善了对受保护和宽松保护的片段的现有基于解决方案的决策程序，该过程解决了布尔的结合查询，以解决受保护的，宽松的保护和clique-woard-woard-woard的片段。基于此查询答录过程，我们还为这些受保护的片段介绍了一种基于饱和的查询重写过程。与主流查询答案和重写方法不同，我们的过程得出了一个紧凑而可重复使用的饱和，即公式的封闭，以应对针对分布式数据集的查询挑战。本文为布尔结合查询的第一个自动扣除决策程序奠定了理论基础，以及在受保护的守卫中重写的第一个基于饱和的布尔式散装查询，宽松的保护和集团维护的片段。
Query answering is an important problem in AI, database and knowledge representation. In this paper, we develop saturation-based Boolean conjunctive query answering and rewriting procedures for the guarded, the loosely guarded and the clique-guarded fragments. Our query answering procedure improves existing resolution-based decision procedures for the guarded and the loosely guarded fragments and this procedure solves Boolean conjunctive query answering problems for the guarded, the loosely guarded and the clique-guarded fragments. Based on this query answering procedure, we also introduce a novel saturation-based query rewriting procedure for these guarded fragments. Unlike mainstream query answering and rewriting methods, our procedures derive a compact and reusable saturation, namely a closure of formulas, to handle the challenge of querying for distributed datasets. This paper lays the theoretical foundations for the first automated deduction decision procedures for Boolean conjunctive query answering and the first saturation-based Boolean conjunctive query rewriting in the guarded, the loosely guarded and the clique-guarded fragments.
