Petar Vukmirović ; Alexander Bentkamp ; Visa Nummelin - Efficient Full Higher-Order Unification

lmcs:6919 - Logical Methods in Computer Science, December 14, 2021, Volume 17, Issue 4 - https://doi.org/10.46298/lmcs-17(4:18)2021
Efficient Full Higher-Order Unification

Authors: Petar Vukmirović ; Alexander Bentkamp ; Visa Nummelin

    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.


    Volume: Volume 17, Issue 4
    Published on: December 14, 2021
    Accepted on: October 4, 2021
    Submitted on: November 20, 2020
    Keywords: Computer Science - Logic in Computer Science
    Fundings :
      Source : OpenAIRE Research Graph
    • Fast Interactive Verification through Strong Higher-Order Automation; Funder: European Commission; Code: 713999

    1 Document citing this article

    Share

    Consultation statistics

    This page has been seen 223 times.
    This article's PDF has been downloaded 225 times.