2272 search results - page 329 / 455 » A Calculus for |
117
Voted
TABLEAUX
1999
Springer
15 years 5 months ago
1999
Springer
We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed wi...
117
click to vote
CCS
1998
ACM
15 years 5 months ago
1998
ACM
We develop a framework for analyzing security protocols in which protocol adversaries may be arbitrary probabilistic polynomial-time processes. In this framework, protocols are wr...
94
Voted
POPL
1998
ACM
15 years 5 months ago
1998
ACM
Data structures with a hole, in other words data structures with an uninitialized field, are useful to write efficient programs: they enable us to construct functional data stru...
104
Voted
ARITH
1997
IEEE
15 years 5 months ago
1997
IEEE
In this paper we present a rigorous theoretical analysis of the main properties of a double base number system, using bases 2 and 3; in particular we emphasize the sparseness of t...
103
Voted
TABLEAUX
1998
Springer
15 years 5 months ago
1998
Springer
The methodology of fibring is a successful framework for combining logical systems based on combining their semantics. In this paper, we extend the fibring approach to calculi for ...