Finite Quantification in Hierarchic Theorem Proving

Abstract : 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.
Type de document :
Communication dans un congrès
Stéphane Demri and Deepak Kapur and Christoph Weidenbach. 7th International Joint Conference on Automated Reasoning (IJCAR 2014), Jul 2014, Vienna, Austria. Springer, 8562, pp.152-167, Lecture Notes in Computer Science
Liste complète des métadonnées

https://hal.inria.fr/hal-01087873
Contributeur : Stephan Merz <>
Soumis le : jeudi 27 novembre 2014 - 03:16:13
Dernière modification le : jeudi 22 septembre 2016 - 14:31:49

Identifiants

  • HAL Id : hal-01087873, version 1

Collections

Citation

Peter Baumgartner, Joshua Bax, Uwe Waldmann. Finite Quantification in Hierarchic Theorem Proving. Stéphane Demri and Deepak Kapur and Christoph Weidenbach. 7th International Joint Conference on Automated Reasoning (IJCAR 2014), Jul 2014, Vienna, Austria. Springer, 8562, pp.152-167, Lecture Notes in Computer Science. 〈hal-01087873〉

Partager

Métriques

Consultations de la notice

93