16 search results - page 2 / 4 » Expressive Equivalence of Formalisms for Planning with Sensi... |
CAV
2006
Springer
13 years 9 months ago
2006
Springer
The relationship between two well established formalisms for temporal reasoning is first investigated, namely between Allen's interval algebra (or Allen's temporal logic,...
ENTCS
1998
13 years 5 months ago
1998
We obtain a new formalism for concurrent object-oriented languages by extending Abadi and Cardelli's imperative object calculus with operators for concurrency from the -calc...
IEEEARES
2009
IEEE
14 years 6 days ago
2009
IEEE
—In voting, the notion of receipt-freeness has been proposed to express that a voter cannot gain any information to prove that she has voted in a certain way. It aims to prevent ...
LICS
2007
IEEE
13 years 11 months ago
2007
IEEE
The combination of first-order epistemic logic and formal cryptography offers a potentially very powerful framework for security protocol verification. In this article, we addre...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...