Download PDFOpen PDF in browser

The Architecture of Inference from SMT to ETB

1 pagesPublished: August 19, 2013

Abstract

Modularity plays a central role in logical reasoning. We want to be
able to reuse proofs, proof patterns, theories, and specialized
reasoning procedures. Architectures that support modularity have been
developed at all levels of inference: SAT solvers, theory solvers,
combination solvers and rewriters, SMT solvers, simplifiers, rewriters,
and tactics-based interactive theorem provers. Prior work has mostly
focused on fine-grained modular inference. However, with the
availability of a diverse range of high-quality inference tools, it has
become important to systematically integrate these big components into
robust toolchains. At SRI, we have been developing a framework called
the Evidential Tool Bus (ETB) as a distributed platform for the
coarse-grained integration of inference components into flexible,
scriptable workflows. The talk describes the architecture of ETB along
with some motivating applications.

In: Pascal Fontaine and Amit Goel (editors). SMT 2012. 10th International Workshop on Satisfiability Modulo Theories, vol 20, pages 2.

BibTeX entry
@inproceedings{SMT2012:Architecture_Inference_from_SMT,
  author    = {Natarajan Shankar},
  title     = {The Architecture of Inference from SMT to ETB},
  booktitle = {SMT 2012. 10th International Workshop on Satisfiability Modulo Theories},
  editor    = {Pascal Fontaine and Amit Goel},
  series    = {EPiC Series in Computing},
  volume    = {20},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/DC4n},
  doi       = {10.29007/1tc6},
  pages     = {2},
  year      = {2013}}
Download PDFOpen PDF in browser