1960 search results - page 55 / 392 » The Logic of Large Enough |
DM
1998
13 years 7 months ago
1998
For every integer p > 0 let f(p) be the minimum possible value of the maximum weight of a cut in an integer weighted graph with total weight p. It is shown that for every large...
UC
2009
Springer
14 years 2 months ago
2009
Springer
We present a logical approach to the separability analysis issue for a functional quantum computation language. This logic is inspired by previous works on logical analysis of alia...
ENTCS
2007
13 years 7 months ago
2007
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
SEBD
2003
13 years 9 months ago
2003
The Ambient Logic is a modal logic proposed to describe the structural and computational properties of distributed and mobile computations. The static part of the Ambient Logic is,...
SAC
2006
ACM
14 years 1 months ago
2006
ACM
Constraint-based mining techniques on sequence databases have been studied extensively the last few years and efficient algorithms enable to compute complete collections of patte...