1894 search results - page 297 / 379 » A TLA Proof System |
151
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
We consider Glauber dynamics on finite spin systems. The mixing time of Glauber dynamics can be bounded in terms of the influences of sites on each other. We consider three parame...
151
click to vote
FLOPS
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We present a declarative method for diagnosing missing computed answers in CFLP(D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instant...
114
click to vote
APAL
2010
15 years 4 months ago
2010
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
125
click to vote
JSC
2007
15 years 3 months ago
2007
A well-known result due to J. T. Stafford asserts that a stably free left module M over the Weyl algebras D = An(k) or Bn(k) − where k is a field of characteristic 0 − with ...
133
click to vote
JSS
2007
15 years 3 months ago
2007
Designing large software systems out of reusable components has become increasingly popular. Although liberal composition of reusable components saves time and expense, many exper...