论文标题
有效的全阶统一
Efficient Full Higher-Order Unification
论文作者
论文摘要
我们开发了一项程序，根据Jensen和Pietrzykowski的工作列举完整的高阶统一机。我们的程序通过仔细限制搜索空间并严格整合了允许有限完整的统一器集的片段来消除许多冗余统一器。我们确定了一个新的片段，并描述了计算其统一器的程序。我们的统一过程以及新的高阶项索引数据结构在ZipperPosition定理供体中实现。实验评估表明，与Jensen和Pietrzykowski的程序具有明显的优势。
We developed a procedure to enumerate complete sets of higher-order unifiers based on work by Jensen and Pietrzykowski. Our procedure removes many redundant unifiers by carefully restricting the search space and tightly integrating decision procedures for fragments that admit a finite complete set of unifiers. We identify a new such fragment and describe a procedure for computing its unifiers. Our unification procedure, together with new higher-order term indexing data structures, is implemented in the Zipperposition theorem prover. Experimental evaluation shows a clear advantage over Jensen and Pietrzykowski's procedure.
