License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSCD.2020.5
URN: urn:nbn:de:0030-drops-123271
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/12327/
Go to the corresponding LIPIcs Volume Portal

Vukmirović, Petar ; Bentkamp, Alexander ; Nummelin, Visa

Efficient Full Higher-Order Unification

pdf-format:
LIPIcs-FSCD-2020-5.pdf (0.5 MB)

Abstract

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 is implemented in the Zipperposition theorem prover. Experimental evaluation shows a clear advantage over Jensen and Pietrzykowski’s procedure.

BibTeX - Entry

@InProceedings{vukmirovi_et_al:LIPIcs:2020:12327,
  author =	{Petar Vukmirović and Alexander Bentkamp and Visa Nummelin},
  title =	{{Efficient Full Higher-Order Unification}},
  booktitle =	{5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020)},
  pages =	{5:1--5:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-155-9},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{167},
  editor =	{Zena M. Ariola},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/12327},
  URN =		{urn:nbn:de:0030-drops-123271},
  doi =		{10.4230/LIPIcs.FSCD.2020.5},
  annote =	{Keywords: unification, higher-order logic, theorem proving, term rewriting, indexing data structures}
}

Keywords: unification, higher-order logic, theorem proving, term rewriting, indexing data structures
Collection: 5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020)
Issue Date: 2020
Date of publication: 28.06.2020
Supplementary Material: An archive with raw results, all used problems, and scripts for running each configuration is available at http://matryoshka.gforge.inria.fr/pubs/hounif_data.zip.

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI