• Corpus ID: 84178912

Extending SMT solvers to Higher-Order Logic ( Technical Report )

  title={Extending SMT solvers to Higher-Order Logic ( Technical Report )},
  author={Haniel Barbosa and Andrew Reynolds and Daniel El Ouraoui and Cesare Tinelli and Clark W. Barrett},
Satisfiability modulo theories (SMT) solvers have throughout the years been able to cope with increasingly expressive formulas, from ground logics to full first-order logic (FOL) modulo theories. Nevertheless, higher-order logic within SMT is still little explored. We propose a pragmatic extension of SMT solvers to natively support higher-order reasoning without compromising their performance on FOL problems, thus leveraging the extensive research and implementation efforts dedicated to… 

Figures and Tables from this paper

Extending SMT Solvers to Higher-Order Logic
This work proposes a pragmatic extension for SMT solvers to support HOL reasoning natively without compromising performance on FOL reasoning, thus leveraging the extensive research and implementation efforts dedicated to efficient SMT solving.


Language and Proofs for Higher-Order SMT (Work in Progress)
An extension of the SMT-LIB language, the standard input format of SMT solvers, to handle higher-order constructs and how to augment the proof format of theSMT solver veriT to accommodate these new constructs and the solving techniques they require is discussed.
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
This work presents several decidable fragments of first order logic modulo theories, and shows how to construct models for satisfiable formulas in these fragments.
Finite Model Finding in SMT
A novel finite model finding method that reduces limitations in the case of quantifiers ranging over free sorts in SMT by not relying on the introduction of domain constants for the free sorts and by being fully integrated into the general architecture used by most SMT solvers.
Quantifier Instantiation Techniques for Finite Model Finding in SMT
This work proposes instantiation strategies to identify and consider only a selection of ground instances that suffices to determine the satisfiability of the input formula, and examines heuristic quantifier instantiation techniques such as E-matching for the purpose of accelerating the search.
Congruence Closure with Free Variables
It is shown that the major instantiation techniques in SMT solving can be cast in a unifying framework for handling quantified formulas with equality and uninterpreted functions, and a sound and complete calculus is introduced to solve this problem in practice.
Set of Support for Higher-Order Reasoning
Limiting how axioms introduced during translation can improve proof search with higher-order problems is shown and heuristics based on the set-of-support strategy for minimising the effects are introduced.
Efficient E-Matching for SMT Solvers
An index that works on E-graphs is introduced, called E-matching code treesthat combine features of substitution and code trees, used in saturation based theorem provers and shows substantial performance improvements over existing state-of-the-art SMT solvers.
Revisiting Enumerative Instantiation
This paper revisits enumerative instantiation, a technique that considers instantiations based on exhaustive enumeration of ground terms, and presents a stronger Herbrand Theorem, better suited as a basis for the instantiation loop used in SMT solvers.
The Higher-Order Prover Leo-III
The automated theorem prover Leo-III for classical higher-order logic with Henkin semantics and choice is presented and natively supports almost every normal higher- order modal logic.
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)
Extensive experimental evidence shows that DPLL(T) systems can significantly outperform the other state-of-the-art tools, frequently even in orders of magnitude, and have better scaling properties.