126
click to vote
CADE
16 years 1 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...
125
click to vote
CADE
16 years 1 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...
124
Voted
CADE
16 years 1 months ago
2004 Springer
This paper presents the Dr.Doodle system, an interactive theorem prover that uses diagrammatic representations. The assumption underlying this project is that, for some domains (pr...
120
Voted
CADE
15 years 6 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...
116
click to vote
CADE
16 years 1 months ago
2004 Springer
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
|
Logical Reasoning