3228 search results - page 399 / 646 » Computationally Sound Proofs |
113
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
As a general framework, UNITY does not offer any specific facility for the design of distributed systems. For such systems, distribution aspects must be represented at a low level,...
131
click to vote
TLCA
1999
Springer
15 years 8 months ago
1999
Springer
In this paper we present a strongly normalising cut-elimination procedure for classical logic. This procedure adapts Gentzen’s standard cut-reductions, but is less restrictive th...
102
Voted
COCO
1994
Springer
15 years 7 months ago
1994
Springer
Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the determinant is characterized by the complexity of counting the number of accepting computati...
122
Voted
RTA
1993
Springer
15 years 7 months ago
1993
Springer
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ â...
123
Voted
FOCS
1990
IEEE
15 years 7 months ago
1990
IEEE
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...