4573 search results - page 475 / 915 » Automated Reasoning |
178
click to vote
CADE
2004
Springer
16 years 6 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...
167
click to vote
CADE
2004
Springer
16 years 6 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...
161
click to vote
CADE
2003
Springer
16 years 6 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...
185
click to vote
CADE
2003
Springer
16 years 6 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...
134
click to vote
CADE
2002
Springer
16 years 6 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...