Sciweavers

2432 search results - page 152 / 487
» Cryptographic logical relations
Sort
View
130
Voted
TYPES
2000
Springer
15 years 4 months ago
Executing Higher Order Logic
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...
Stefan Berghofer, Tobias Nipkow
89
Voted
CSL
2008
Springer
15 years 2 months ago
Quantitative Game Semantics for Linear Logic
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...
Ugo Dal Lago, Olivier Laurent
132
Voted
AAAI
2006
15 years 2 months ago
A Computational Model of Logic-Based Negotiation
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 ...
Dongmo Zhang, Yan Zhang
83
Voted
CORR
2010
Springer
153views Education» more  CORR 2010»
15 years 25 days ago
Characterising Probabilistic Processes Logically
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...
Yuxin Deng, Rob J. van Glabbeek
93
Voted
CORR
2010
Springer
125views Education» more  CORR 2010»
15 years 25 days ago
Tree Languages Defined in First-Order Logic with One Quantifier Alternation
We study tree languages that can be defined in 2. These are tree languages definable by a first-order formula whose quantifier prefix is , and simultaneously by a first-order for...
Mikolaj Bojanczyk, Luc Segoufin