122
click to vote
CADE
16 years 1 months ago
2003 Springer 
Ordinals form the basis for termination proofs in ACL2. Currently, ACL2 uses a rather inefficient representation for the ordinals up to 0 and provides limited support for reasoning...
127
click to vote
CADE
16 years 1 months ago
2003 Springer 
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...
111
click to vote
CADE
16 years 1 months ago
2003 Springer 
We describe the integration of permutation group algorithms with proof planning. We consider eight basic questions arising in computational permutation group theory, for which our ...
CADE
16 years 1 months ago
2003 Springer 
This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the stron...
CADE
16 years 1 months ago
2003 Springer
We make the notion of scope in the -calculus explicit. To that end, the syntax of the -calculus is extended with an end-of-scope operator , matching the usual opening of a scope du...
|
Logical Reasoning