2145 search results - page 124 / 429 » Lax Logical Relations |
142
Voted
FORMATS
2005
Springer
15 years 10 months ago
2005
Springer
This paper attempts to improve our understanding of timed languages and their relation to timed automata. We start by giving a constructive proof of the folk theorem stating that t...
161
click to vote
TYPES
2000
Springer
15 years 8 months ago
2000
Springer
We report on the design of a prototyping component for the theorem prover Isabelle/HOL. Specifications consisting of datatypes, recursive functions and inductive definitions are co...
123
click to vote
CSL
2008
Springer
15 years 6 months ago
2008
Springer
We present a game-based semantic framework in which the time complexity of any IMELL proof can be read out of its interpretation. This gives a compositional view of the geometry of...
176
Voted
AAAI
2006
15 years 6 months ago
2006
This paper presents a computational model of negotiation based on Nebel's syntax-based belief revision. The model guarantees a unique bargaining solution for each bargaining ...
119
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper we work on (bi)simulation semantics of processes that exhibit both nondeterministic and probabilistic behaviour. We propose a probabilistic extension of the...