Hierarchic Superposition: Completeness without Compactness

Peter Baumgartner and Uwe Waldmann

In Marek Košta, Thomas Sturm, editors, Fifth International Conference on Mathematical Aspects of Computer and Information Sciences, MACIS 2013, pages 8-12, Nanning, China, December 11-13, 2013. [PDF file]

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.


Previous | Up | Next
Uwe Waldmann <uwe@mpi-inf.mpg.de>, 2014-11-19.
Imprint | Data Protection