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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Logical methods in computer science Ročník 19; číslo 2
Hlavní autoři:	Blanchette, Jasmin, Vukmirović, Petar
Médium:	Paper Journal Article
Jazyk:	angličtina
Vydáno:	Ithaca Cornell University Library, arXiv.org 05.05.2023 Logical Methods in Computer Science Association
Témata:	Computer Science Theorem proving Logic in Computer Science (cs.LO) FOS: Computer and information sciences
ISSN:	2331-8422, 1860-5974
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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.
Bibliografie:	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