SAT-Inspired Higher-Order Eliminations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Logical Methods in Computer Science Year : 2023

SAT-Inspired Higher-Order Eliminations

Abstract

We generalize several propositional preprocessing techniques to higher-order logic, building on existing first-order generalizations. These techniques eliminate literals, clauses, or predicate symbols from the problem, with the aim of making it more amenable to automatic proof search. We also introduce a new technique, which we call quasipure literal elimination, that strictly subsumes pure literal elimination. The new techniques are implemented in the Zipperposition theorem prover. Our evaluation shows that they sometimes help prove problems originating from Isabelle formalizations and the TPTP library.
Fichier principal
Vignette du fichier
article.pdf (451.68 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04298561 , version 1 (21-11-2023)

Licence

Identifiers

Cite

Jasmin Blanchette, Petar Vukmirović. SAT-Inspired Higher-Order Eliminations. Logical Methods in Computer Science, 2023, 19 (2), ⟨10.48550/arXiv.2208.07775⟩. ⟨hal-04298561⟩
8 View
6 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More