可分解理论
Decomposable Theories
摘要:
本文提出了一种求解一阶公式的一般算法,这种算法被称为“可分解理论”。首先,利用特殊的量词,我们给出了可分解理论的一个形式刻画,并给出了它们的一些性质。然后,我们给出了求解任意可分解理论T中一阶公式的一般算法。该算法以五个重写规则的形式给出。它将可能包含自由变量的一阶公式“P”转换为求解公式的合取“Q”,该合取“Q”可容易地转换为原子公式的存在量化合取的布尔组合。特别地,如果“P”没有自由变量,那么“Q”要么是公式“true”要么是“false”。算法的正确性证明了可分解理论的完备性。最后,我们证明了有限或无限树的理论“Tr”是一个可分解的理论,并给出了一些基准实现我们的算法,解决公式的两个合作伙伴的游戏在“Tr”与160多个嵌套交替量词。
英文摘要:
We present in this paper a general algorithm for solving first-order formulas in particular theories called "decomposable theories". First of all, using special quantifiers, we give a formal characterization of decomposable theories and show some of their properties. Then, we present a general algorithm for solving first-order formulas in any decomposable theory "T". The algorithm is given in the form of five rewriting rules. It transforms a first-order formula "P", which can possibly contain free variables, into a conjunction "Q" of solved formulas easily transformable into a Boolean combination of existentially quantified conjunctions of atomic formulas. In particular, if "P" has no free variables then "Q" is either the formula "true" or "false". The correctness of our algorithm proves the completeness of the decomposable theories. Finally, we show that the theory "Tr" of finite or infinite trees is a decomposable theory and give some benchmarks realized by an implementation of our algorithm, solving formulas on two-partner games in "Tr" with more than 160 nested alternated quantifiers.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。