Sciweavers

3776 search results - page 248 / 756
» Partition-Based Logical Reasoning
Sort
View
CADE
2006
Springer
16 years 4 months ago
Verifying Mixed Real-Integer Quantifier Elimination
Abstract. We present a formally verified quantifier elimination procedure for the first order theory over linear mixed real-integer arithmetics in higher-order logic based on a wor...
Amine Chaieb
CADE
2006
Springer
16 years 4 months ago
Connection Tableaux with Lazy Paramodulation
It is well-known that the connection refinement of clause tableaux with paramodulation is incomplete (even with weak connections). In this paper, we present a new connection tablea...
Andrey Paskevich
CADE
2001
Springer
16 years 4 months ago
JProver : Integrating Connection-Based Theorem Proving into Interactive Proof Assistants
Abstract. JProver is a first-order intuitionistic theorem prover that creates sequent-style proof objects and can serve as a proof engine in interactive proof assistants with expre...
Stephan Schmitt, Lori Lorigo, Christoph Kreitz, Al...
VSTTE
2005
Springer
15 years 9 months ago
Decision Procedures for the Grand Challenge
Abstract. The Verifying Compiler checks the correctness of the program it compiles. The workhorse of such a tool is the reasoning engine, which decides validity of formulae in a su...
Daniel Kroening
CSL
2001
Springer
15 years 8 months ago
Uniform Derivation of Decision Procedures by Superposition
We show how a well-known superposition-based inference system for first-order equational logic can be used almost directly as a decision procedure for various theories including l...
Alessandro Armando, Silvio Ranise, Michaël Ru...