SAT-Inspired Higher-Order Eliminations

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Blanchette, Jasmin, Vukmirović, Petar
Format: Preprint
Veröffentlicht: 2022
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866909103744352256
author Blanchette, Jasmin
Vukmirović, Petar
author_facet Blanchette, Jasmin
Vukmirović, Petar
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2208_07775
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle SAT-Inspired Higher-Order Eliminations
Blanchette, Jasmin
Vukmirović, Petar
Logic in Computer Science
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.
title SAT-Inspired Higher-Order Eliminations
topic Logic in Computer Science
url https://arxiv.org/abs/2208.07775