895 search results - page 56 / 179 » A Spectrum of Applications of Automated Reasoning |
136
click to vote
CADE
2004
Springer
16 years 4 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...
136
click to vote
CADE
2003
Springer
16 years 4 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...
153
click to vote
CADE
2003
Springer
16 years 4 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...
136
click to vote
TIME
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper we extend the notion of k-anonymity in the context of databases with timestamped information in order to naturally define k-anonymous views of temporal data. We als...
137
click to vote
TIME
2005
IEEE
15 years 10 months ago
2005
IEEE
A clausal resolution approach originally developed for the branching logic CTL has recently been extended to the logics ECTL and ECTL+ . In the application of the resolution rules...