330
Voted
CADE
16 years 8 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...
250
click to vote
CADE
16 years 8 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...
242
click to vote
CADE
16 years 8 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...
226
click to vote
CADE
16 years 8 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...
223
click to vote
CADE
16 years 1 months ago
2004 Springer 
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
|
Logical Reasoning