EFFICIENT FULL HIGHER-ORDER UNIFICATION

被引：2
|
作者：
Vukmirovic, Petar [1 ]
Bentkamp, Alexander [1 ]
Nummelin, Visa [1 ]
机构：
[1] Vrije Univ Amsterdam, De Boelelaan 1111, NL-1081 HV Amsterdam, Netherlands
来源：
LOGICAL METHODS IN COMPUTER SCIENCE | 2021年 / 17卷 / 04期
基金：
欧洲研究理事会;
关键词：
unification; higher-order logic; theorem proving; term rewriting; indexing data structures; SET;
D O I：
10.46298/LMCS-17(4:18)2021
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页数：31
相关论文
共 50 条
  • [1] Deaccenting and higher-order unification
    Gardent C.
    Journal of Logic, Language and Information, 2000, 9 (3) : 313 - 338
  • [2] Corrections and higher-order unification
    Gardent, C
    Kohlhase, M
    van Leusen, N
    NATURAL LANGUAGE PROCESSING AND SPEECH TECHNOLOGY: RESULTS OF THE 3RD KONVENS CONFERENCE, 1996, : 268 - 279
  • [3] Ramified higher-order unification
    GoubaultLarrecq, J
    12TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 1997, : 410 - 421
  • [4] Decidability of bounded higher-order unification
    Schmidt-Schauss, M
    Schulz, KU
    JOURNAL OF SYMBOLIC COMPUTATION, 2005, 40 (02) : 905 - 954
  • [5] HIGHER-ORDER UNIFICATION VIA COMBINATORS
    DOUGHERTY, DJ
    THEORETICAL COMPUTER SCIENCE, 1993, 114 (02) : 273 - 298
  • [6] Optimizing higher-order pattern unification
    Pientka, B
    Pfenning, F
    AUTOMATED DEDUCTION - CADE-19, PROCEEDINGS, 2003, 2741 : 473 - 487
  • [7] HIGHER-ORDER UNIFICATION, POLYMORPHISM, AND SUBSORTS
    NIPKOW, T
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 516 : 436 - 447
  • [8] Decidability of bounded higher-order unification
    Schmidt-Schauss, M
    Schulz, KU
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2002, 2471 : 522 - 536
  • [9] Decidable variants of higher-order unification
    Schmidt-Schauss, M
    MECHANIZING MATHEMATICAL REASONING: ESSAYS IN HONOUR OF JORG H SIEKMANN ON THE OCCASION OF HIS 60TH BIRTHDAY, 2005, 2605 : 154 - 168
  • [10] Linear higher-order pre-unification
    Cervesato, I
    Pfenning, F
    12TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 1997, : 422 - 433
12345