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

Full description

Saved in:

Bibliographic Details
Published in:	Logical methods in computer science Vol. 19, Issue 2
Main Authors:	Blanchette, Jasmin, Vukmirović, Petar
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science e.V 08.05.2023
Subjects:	computer science - logic in computer science
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
ISSN:	1860-5974 1860-5974
DOI:	10.46298/lmcs-19(2:9)2023