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

Bibliographic Details

Published in:	Logical methods in computer science Vol. 19; no. 2
Main Authors:	Blanchette, Jasmin, Vukmirović, Petar
Format:	Paper Journal Article
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 05.05.2023 Logical Methods in Computer Science Association
Subjects:	Computer Science Theorem proving Logic in Computer Science (cs.LO) FOS: Computer and information sciences
ISSN:	2331-8422, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!