3552 search results - page 234 / 711 » Proof theory in the abstract |
166
click to vote
MOBIHOC
2007
ACM
16 years 6 months ago
2007
ACM
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
158
click to vote
PPOPP
2010
ACM
16 years 3 months ago
2010
ACM
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
168
click to vote
CSL
2007
Springer
16 years 22 days ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
170
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
Levesque introduced the notion of only-knowing to precisely capture the beliefs of a knowledge base. He also showed how only-knowing can be used to formalize non-monotonic behavio...
157
click to vote
JAR
2008
15 years 6 months ago
2008
We present a simple formulation of Assumption-Commitment reasoning using CSP. In our formulation, an assumption-commitment style property of a process SYS takes the form COM SYS A...