arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2206.03124cs.AI
收藏

潜在规则的规范化:并非如此无害!

Normalisations of Existential Rules: Not so Innocuous!

LIRMM(蒙彼利埃计算机科学、机器人与微电子实验室);Inria(法国国家信息与自动化研究所);University of Montpellier(蒙彼利埃大学);CNRS(法国国家科学研究中心);DI ENS(巴黎高等师范学院计算机系);ENS(巴黎高等师范学院);PSL University(巴黎文理研究大学)

David Carral, Lucas Larroque, Marie-Laure Mugnier, Michaël Thomazo

摘要:

隐式规则是一种表达性的知识表示语言,主要用于查询数据。在文献中,它们通常被认为是某种简化技术开发的范式。例如,一个常见的假设是规则头是原子的,即,仅限于单个原子。这些假设被认为是在不失一般性的情况下做出的,只要所有规则集都可以被规范化,同时保留蕴涵。然而,一个重要的问题是,确保推理的可判定性的属性是否也被保留。我们提供了一个系统的研究,这些程序对不同的大通变量方面的大通(非)终止和FO重写的影响。这也导致我们研究与追逐终止独立利益相关的开放问题。

英文摘要:

Existential rules are an expressive knowledge representation language mainly developed to query data. In the literature, they are often supposed to be in some normal form that simplifies technical developments. For instance, a common assumption is that rule heads are atomic, i.e., restricted to a single atom. Such assumptions are considered to be made without loss of generality as long as all sets of rules can be normalised while preserving entailment. However, an important question is whether the properties that ensure the decidability of reasoning are preserved as well. We provide a systematic study of the impact of these procedures on the different chase variants with respect to chase (non-)termination and FO-rewritability. This also leads us to study open problems related to chase termination of independent interest.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑