Extending SMT Solvers to Higher-Order Logic

Abstract : SMT solvers have throughout the years been able to cope with increasingly expressive formulas, from ground logics to full first-order logic (FOL). In contrast, the extension of SMT solvers to higher-order logic (HOL) is mostly un-explored. We propose 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. We show how to generalize data structures and the ground decision procedure to support partial applications and extensionality, as well as how to reconcile quantifier instantiation techniques with higher-order variables. We also discuss a separate approach for redesigning an HOL SMT solver from the ground up via new data structures and algorithms. We apply our pragmatic extension to the CVC4 SMT solver and discuss a redesign of the veriT SMT solver. Our evaluation shows they are competitive with state-of-the-art HOL provers and often outperform the traditional encoding into FOL.
Document type :
Book sections
Complete list of metadatas

Cited literature [48 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02300986
Contributor : El Ouraoui Daniel <>
Submitted on : Monday, September 30, 2019 - 10:03:15 AM
Last modification on : Tuesday, October 1, 2019 - 1:20:53 AM

File

conf.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Haniel Barbosa, Andrew Reynolds, Daniel El Ouraoui, Cesare Tinelli, Clark Barrett. Extending SMT Solvers to Higher-Order Logic. Automated Deduction - CADE 27 - 27th International Conference on Automated Deduction, pp.35-54, 2019, ⟨10.1007/978-3-030-29436-6_3⟩. ⟨hal-02300986⟩

Share

Metrics

Record views

20

Files downloads

6