arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1806.09392cs.LOcs.DMcs.PL
收藏

通过图饱和度查找模型

Finding models through graph saturation

Sebastiaan J. C. Joosten

摘要:

我们给出了一个程序,可以用来自动满足一定形状的不变量。这些不变量可以用运算交集、合成和二元关系上的转换以及这些运算上的相等来写。我们称这些不变量为\tr{},我们解释了图。对于通过这些句子集合陈述的问题,本文给出了一个半判定过程,我们称之为图饱和。它决定在这些\tr{}上的蕴涵,灵感来自图重写。我们证明了程序的正确性。此外,我们证明了相应的决策问题是不可判定的。这证实了作者先前提出的一个猜想。

英文摘要:

We give a procedure that can be used to automatically satisfy invariants of a certain shape. These invariants may be written with the operations intersection, composition and converse over binary relations, and equality over these operations. We call these invariants \tr{}s that we interpret over graphs. For questions stated through sets of these sentences, this paper gives a semi-decision procedure we call graph saturation. It decides entailment over these \tr{}s, inspired on graph rewriting. We prove correctness of the procedure. Moreover, we show the corresponding decision problem to be undecidable. This confirms a conjecture previously stated by the author.

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

↑