Links

Tools

Export citation

Search in Google Scholar

J Autom Reasoning (2013) 51:109–128 DOI 10.1007/s10817-013-9278-5 Extending Sledgehammer with SMT Solvers

This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Question mark in circle
Preprint: policy unknown
Question mark in circle
Postprint: policy unknown
Question mark in circle
Published version: policy unknown

Abstract

Abstract Sledgehammer is a component of Isabelle/HOL that employs resolutionbased first-order automatic theorem provers (ATPs) to discharge goals arising in interactive proofs. It heuristically selects relevant facts and, if an ATP is successful, produces a snippet that replays the proof in Isabelle. We extended Sledgehammer to invoke satisfiability modulo theories (SMT) solvers as well, exploiting its relevance filter and parallel architecture. The ATPs and SMT solvers nicely complement each other, and Isabelle users are now pleasantly surprised by SMT proofs for problems beyond the ATPs ’ reach.