三值几何归结的子sumption算法
Subsumption Algorithms for Three-Valued Geometric Resolution
AI总结:
本文针对三值几何归结中的子sumption测试难题,将其转化为广义约束满足问题,提出直接算法和两种SAT转化,并利用局部一致性过滤及最小子集求解,提升效率且可独立应用于约束求解。
摘要:
在我们对几何归结的实现中,最昂贵的操作是子sumption测试(或匹配):需要判定一个三值几何公式在给定解释下是否为假。该公式仅包含带变量、等式和存在量词的原子。解释仅包含带常量的原子。由于原子没有项结构,几何归结的匹配是困难的。我们将匹配问题转化为广义约束满足问题,并讨论几种高效求解的方法:一个直接算法和两个到命题SAT的转化。之后,我们研究基于局部一致性检查的过滤技术。这种过滤技术可以预先反驳大量广义约束满足问题。最后,我们调整匹配算法,使其找到使用解释的最小子集的解。该调整可以与任何匹配算法结合。本文提出的技术可能在与几何归结无关的约束求解中有应用。
英文摘要:
In our implementation of geometric resolution, the most costly operation is subsumption testing (or matching): One has to decide for a three-valued, geometric formula, if this formula is false in a given interpretation. The formula contains only atoms with variables, equality, and existential quantifiers. The interpretation contains only atoms with constants. Because the atoms have no term structure, matching for geometric resolution is hard. We translate the matching problem into a generalized constraint satisfaction problem, and discuss several approaches for solving it efficiently, one direct algorithm and two translations to propositional SAT. After that, we study filtering techniques based on local consistency checking. Such filtering techniques can a priori refute a large percentage of generalized constraint satisfaction problems. Finally, we adapt the matching algorithms in such a way that they find solutions that use a minimal subset of the interpretation. The adaptation can be combined with every matching algorithm. The techniques presented in this paper may have applications in constraint solving independent of geometric resolution.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。