Jasmin Blanchette ; Petar Vukmirović - SAT-Inspired Higher-Order Eliminations

lmcs:9928 - Logical Methods in Computer Science, May 8, 2023, Volume 19, Issue 2 - https://doi.org/10.46298/lmcs-19(2:9)2023
SAT-Inspired Higher-Order EliminationsArticle

Authors: Jasmin Blanchette ; Petar Vukmirović

    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.


    Volume: Volume 19, Issue 2
    Published on: May 8, 2023
    Accepted on: March 23, 2023
    Submitted on: August 17, 2022
    Keywords: Computer Science - Logic in Computer Science
    Funding:
      Source : OpenAIRE Graph
    • Fast Interactive Verification through Strong Higher-Order Automation; Funder: European Commission; Code: 713999

    1 Document citing this article

    Consultation statistics

    This page has been seen 1079 times.
    This article's PDF has been downloaded 200 times.