Aug 16, 2022 · These techniques eliminate literals, clauses, or predicate symbols from the problem, with the aim of making it more amenable to automatic proof ...

Abstract. We generalize several propositional preprocessing techniques to higher-order logic, building on existing first-order generalizations.

Aug 16, 2022 · In this article, we consider the extension of four main classes of SAT preprocessing techniques to classical higher-order logic. These ...

This is the package containing the raw evaluation data for the paper "SAT-Inspired Higher-Order Eliminations" by Jasmin Blanchette and Petar Vukmirović.

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

This is the package containing the raw evaluation data for the paper "SAT-Inspired Higher-Order Eliminations" by Jasmin Blanchette and Petar Vukmirović.

Bibliographic details on SAT-Inspired Higher-Order Eliminations.

Author: Blanchette, Jasmin et al.; Genre: Journal Article; Issued: 2023; Open Access; Title: SAT-Inspired Higher-Order Eliminations.

In this paper, we lift several preprocessing and inprocessing techniques from propositional logic to clausal first-order logic and demonstrate their usefulness ...

Jan 18, 2023 · In this article, we port inprocessing techniques to work with superposition, a leading first-order proof calculus, and we strengthen known preprocessing ...