286
click to vote
CADE
16 years 7 months ago
2004 Springer 
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...
198
click to vote
CADE
16 years 7 months ago
2004 Springer
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of pow...
197
click to vote
CADE
16 years 7 months ago
2004 Springer
contexts such as construction of abstractions, speed may be favored over completeness, so that undecidable theories (e.g., nonlinear integer arithmetic) and those whose decision pr...
192
Voted
CADE
16 years 7 months ago
2004 Springer 
Interactive theorem provers can model complex systems, but require much effort to prove theorems. Resolution theorem provers are automatic and powerful, but they are designed to be...
191
click to vote
CADE
16 years 7 months ago
2004 Springer 
ended abstract motivates and presents techniques for identifying variable independence in free variable calculi for classical logic without equality. Two variables are called indep...
|
Logical Reasoning