Trustworthy Systems

Finite quantification in hierarchic theorem proving


Peter Baumgartner, Joshua Bax and Uwe Waldmann


Max-Planck-Institute for Computer Science


Many applications of automated deduction require reasoning in first-order logic modulo background theories, in particular some form of integer arithmetic. A major unsolved research challenge is to design theorem provers that are ``reasonably complete'' even in the presence of free function symbols ranging into a background theory sort. In this paper we consider the case when all variables occurring below such function symbols are quantified over a finite subset of their domains. We present a (non-naive) decision procedure for background theories extended this way on top of black-box decision procedures for the EA-fragment of the background theory. In its core, it employs a model-guided instantiation strategy for obtaining pure background formulas that are equi-satisfiable with the original formula. Unlike traditional finite model finders, it avoids exhaustive instantiation and, hence, is expected to scale better with the size of the domains. Our main results in this paper are a correctness proof and first experimental results.

BibTeX Entry

    publisher        = {Springer},
    doi              = {10.1007/978-3-319-08587-6_11},
    month            = jul,
    booktitle        = {International Joint Conference on Automated Reasoning},
    paperurl         = {},
    year             = {2014},
    editor           = {{Stephane Demri, Deepak Kapur, Christoph Weidenbach}},
    keywords         = {automated reasoning, first-order logic},
    title            = {Finite Quantification in Hierarchic Theorem Proving},
    pages            = {152--167},
    author           = {Baumgartner, Peter and Bax, Joshua and Waldmann, Uwe},
    address          = {Vienna, Austria}