Sciweavers

14 search results - page 1 / 3
» On the Combination of Congruence Closure and Completion
Sort
View
AISC
2004
Springer
13 years 10 months ago
On the Combination of Congruence Closure and Completion
Christelle Scharff, Leo Bachmair
AISC
2004
Springer
13 years 10 months ago
Proof Search in Minimal Logic
ion Within Partial Deduction for Linear Logic . . . . . . . . . . . . . . . . . 52 P. K¨ungas A Decision Procedure for Equality Logic with Uninterpreted Functions . . . 66 O. Tver...
Helmut Schwichtenberg
ENTCS
2008
89views more  ENTCS 2008»
13 years 4 months ago
CC(X): Semantic Combination of Congruence Closure with Solvable Theories
We present a generic congruence closure algorithm for deciding ground formulas in the combination of the theory of equality with uninterpreted symbols and an arbitrary built-in so...
Sylvain Conchon, Evelyne Contejean, Johannes Kanig...
IANDC
2010
141views more  IANDC 2010»
13 years 3 months ago
Regaining cut admissibility in deduction modulo using abstract completion
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
Guillaume Burel, Claude Kirchner
RTA
2004
Springer
13 years 10 months ago
Rewriting for Fitch Style Natural Deductions
Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ord...
Herman Geuvers, Rob Nederpelt