Abstract. The hierarchical superposition based theorem proving cal-culus of Bachmair, Ganzinger, and Waldmann enables the hierarchic combination of a theory with full first-order logic. If a clause set of the combination enjoys a sufficient completeness criterion, the calculus is even complete. We instantiate the calculus for the theory of linear arith-metic. In particular, we develop new effective versions for the standard superposition redundancy criteria taking the linear arithmetic theory into account. The resulting calculus is implemented in SPASS(LA) and extends the state of the art in proving properties of first-order formulas over linear arithmetic.
The most efficient techniques that have been developed to date for equality handling in first-order ...
International audienceWe present a complete superposition calculus for first-order logic with an int...
The paper describes a superposition calculus where quantifiers are eliminated lazily. Superposition...
Abstract. We present a method of integrating linear rational arithmetic into superposition calculus ...
International audienceMany applications of automated deduction require reasoning in first-order logi...
The first-order theory over non-linear arithmetic including transcendental functions (NLA) is undeci...
The success of superposition-based theorem proving in first-order logic relies in particular on the ...
Many applications of automated deduction require reasoning in first-order logic modulo background th...
The hierarchic superposition calculus over a theory T, called SUP(T), enables sound reasoning on the...
Many applications of automated deduction require reasoning in first-order logic modulo background th...
Abstract. Many applications of automated deduction and verification require reasoning in combination...
The most efficient techniques that have been developed to date for equality handling in first-order ...
We develop special superposition calculi for first-order theorem proving in the theories of abelian ...
We present a modification of the Superposition calculus that is meant to generate consequences of se...
De-partment of Broadband, Communications and the Digital Economy and the Australian Research Council...
The most efficient techniques that have been developed to date for equality handling in first-order ...
International audienceWe present a complete superposition calculus for first-order logic with an int...
The paper describes a superposition calculus where quantifiers are eliminated lazily. Superposition...
Abstract. We present a method of integrating linear rational arithmetic into superposition calculus ...
International audienceMany applications of automated deduction require reasoning in first-order logi...
The first-order theory over non-linear arithmetic including transcendental functions (NLA) is undeci...
The success of superposition-based theorem proving in first-order logic relies in particular on the ...
Many applications of automated deduction require reasoning in first-order logic modulo background th...
The hierarchic superposition calculus over a theory T, called SUP(T), enables sound reasoning on the...
Many applications of automated deduction require reasoning in first-order logic modulo background th...
Abstract. Many applications of automated deduction and verification require reasoning in combination...
The most efficient techniques that have been developed to date for equality handling in first-order ...
We develop special superposition calculi for first-order theorem proving in the theories of abelian ...
We present a modification of the Superposition calculus that is meant to generate consequences of se...
De-partment of Broadband, Communications and the Digital Economy and the Australian Research Council...
The most efficient techniques that have been developed to date for equality handling in first-order ...
International audienceWe present a complete superposition calculus for first-order logic with an int...
The paper describes a superposition calculus where quantifiers are eliminated lazily. Superposition...