SAT-Inspired Higher-Order Eliminations

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 introd...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Logical methods in computer science Jg. 19; H. 2
Hauptverfasser:	Blanchette, Jasmin, Vukmirović, Petar
Format:	Paper Journal Article
Sprache:	Englisch
Veröffentlicht:	Ithaca Cornell University Library, arXiv.org 05.05.2023 Logical Methods in Computer Science Association
Schlagworte:	Computer Science Theorem proving Logic in Computer Science (cs.LO) FOS: Computer and information sciences
ISSN:	2331-8422, 1860-5974
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
Bibliographie:	SourceType-Working Papers-1 ObjectType-Working Paper/Pre-Print-1 content type line 50
ISSN:	2331-8422 1860-5974
DOI:	10.48550/arxiv.2208.07775