3776 search results - page 494 / 756 » Partition-Based Logical Reasoning |
CADE
2003
Springer
14 years 8 months ago
2003
Springer
Developing automatable methods for proving termination of term rewrite systems that resist traditional techniques based on simplification orders has become an active research area ...
CADE
2003
Springer
14 years 8 months ago
2003
Springer
If there exist efficient procedures (canonizers) for reducing terms of two first-order theories to canonical form, can one use them to construct such a procedure for terms of the d...
CADE
2003
Springer
14 years 8 months ago
2003
Springer
Abstract. We present an abstract view of existential variables in a dependently typed lambda-calculus based on modal type theory. This allows us to justify optimizations to pattern...
CADE
2002
Springer
14 years 8 months ago
2002
Springer
In this paper we define a new clausal class, called BU, which can be decided by hyperresolution with splitting. We also consider the model generation problem for BU and show that h...
CADE
2001
Springer
14 years 8 months ago
2001
Springer
Abstract. This paper presents a technique for automated theorem proving with free variable tableaux that does not require backtracking. Most existing automated proof procedures usi...