Language and Proofs for Higher-Order SMT (Work in Progress)

by   Haniel Barbosa, et al.

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 modulo theories. Nevertheless, higher-order logic within SMT is still little explored. One main goal of the Matryoshka project, which started in March 2017, is to extend the reasoning capabilities of SMT solvers and other automatic provers beyond first-order logic. In this preliminary report, we report on an extension of the SMT-LIB language, the standard input format of SMT solvers, to handle higher-order constructs. We also discuss how to augment the proof format of the SMT solver veriT to accommodate these new constructs and the solving techniques they require.


page 1

page 2

page 3

page 4


The VLSAT-3 Benchmark Suite

This report presents VLSAT-3 (an acronym for "Very Large Boolean SATisfi...

Alethe: Towards a Generic SMT Proof Format (extended abstract)

The first iteration of the proof format used by the SMT solver veriT was...

First-Order Logic in Finite Domains: Where Semantic Evaluation Competes with SMT Solving

In this paper, we compare two alternative mechanisms for deciding the va...

On the proof complexity of MCSAT

Satisfiability Modulo Theories (SMT) and SAT solvers are critical compon...

Theory Exploration Powered By Deductive Synthesis

Recent years have seen tremendous growth in the amount of verified softw...

The Imandra Automated Reasoning System (system description)

We describe Imandra, a modern computational logic theorem prover designe...

Using SMT Solvers to Validate Models for AI Problems

Artificial Intelligence problems, ranging form planning/scheduling up to...

Please sign up or login with your details

Forgot password? Click here to reset