Towards a Substitution Tree Based Index for Higher-order Resolution Theorem Provers - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Towards a Substitution Tree Based Index for Higher-order Resolution Theorem Provers

Abstract

One of the reasons that forward search methods, like resolution, are efficient in practice is their ability to utilize many optimization techniques. One such technique is subsumption and one way of utilizing subsumption efficiently is by indexing terms using substitution trees. In this paper we describe an attempt to extend such indexes for the use of higher-order resolution theorem provers. Our attempt tries to handle two difficulties which arise when extending the indexes to higher-order. The first difficulty is the need for higher-order anti-unification. The second difficulty is the closure of clauses under associativity and com-mutativity. We present some techniques which attempt to solve these two problems.
Fichier principal
Vignette du fichier
paper.pdf (273.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01424749 , version 1 (02-01-2017)

Identifiers

  • HAL Id : hal-01424749 , version 1

Cite

Tomer Libal, Alexander Steen. Towards a Substitution Tree Based Index for Higher-order Resolution Theorem Provers. 5th Workshop on Practical Aspects of Automated Reasoning, Jul 2016, Coimbra, Portugal. ⟨hal-01424749⟩
433 View
54 Download

Share

Gmail Facebook X LinkedIn More