Extending SMT Solvers to Higher-Order Logic

Extending SMT Solvers to Higher-Order Logic” by Haniel Barbosa, Andrew Reynolds, Daniel El Ouraoui, Cesare Tinelli, and Clark Barrett. In Proceedings of the 27^th International Conference on Automated Deduction (CADE '19), (Pascal Fontaine, ed.), Aug. 2019, pp. 35-54. Natal, Brazil.


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

BibTeX entry:

   author = {Haniel Barbosa and Andrew Reynolds and Daniel El Ouraoui and
	Cesare Tinelli and Clark Barrett},
   editor = {Pascal Fontaine},
   title = {Extending {SMT} Solvers to Higher-Order Logic},
   booktitle = {Proceedings of the {\it 27^{th}} International Conference
	on Automated Deduction (CADE '19)},
   series = {Lecture Notes in Artificial Intelligence},
   volume = {11716},
   pages = {35--54},
   publisher = {Springer},
   month = aug,
   year = {2019},
   note = {Natal, Brazil},
   url = {http://theory.stanford.edu/~barrett/pubs/BREO+19.pdf}

(This webpage was created with bibtex2web.)