Hierarchic Superposition: Completeness without Compactness

Peter Baumgartner 1 Uwe Waldmann 2, 3
3 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
MPII - Max-Planck-Institut für Informatik, Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : Many applications of automated deduction and verification require reasoning in combinations of theories, such as, on the one hand (some fragment of) first-order logic, and on, the other hand a background theory, such as some form of arithmetic. Unfortunately, due to the high expressivity of the full logic, complete reasoning is impossible in general. It is a realistic goal, however, to devise theorem provers that are "reasonably complete" in practice, and the hierarchic superposition calculus has been designed as a theoretical basis for that. In a recent paper we introduced an extension of hierarchic superposition and proved its completeness for the fragment where every term of the background sort is ground. In this paper, we extend this result and obtain completeness for a larger fragment that admits variables in certain places.
Document type :
Conference papers
Liste complète des métadonnées

Contributor : Stephan Merz <>
Submitted on : Thursday, November 27, 2014 - 2:54:40 AM
Last modification on : Tuesday, February 19, 2019 - 3:40:03 PM


  • HAL Id : hal-01087872, version 1



Peter Baumgartner, Uwe Waldmann. Hierarchic Superposition: Completeness without Compactness. MACIS 2013 - Fifth International Conference on Mathematical Aspects of Computer and Information Sciences, Dec 2013, Nanning, China. pp.8-12. ⟨hal-01087872⟩



Record views