Sciweavers

378 search results - page 71 / 76
» Proof interpretations with truth
Sort
View
AAAI
2011
12 years 7 months ago
Commitment to Correlated Strategies
The standard approach to computing an optimal mixed strategy to commit to is based on solving a set of linear programs, one for each of the follower’s pure strategies. We show t...
Vincent Conitzer, Dmytro Korzhyk
LICS
2009
IEEE
14 years 2 months ago
Ludics with Repetitions (Exponentials, Interactive Types and Completeness)
Abstract. Ludics is peculiar in the panorama of game semantics: we first have the definition of interaction-composition and then we have semantical types, as a set of strategies ...
Michele Basaldella, Claudia Faggian
APAL
2010
115views more  APAL 2010»
13 years 7 months ago
Kripke semantics for provability logic GLP
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...
Lev D. Beklemishev
CORR
2011
Springer
194views Education» more  CORR 2011»
13 years 2 months ago
Polarized Montagovian Semantics for the Lambek-Grishin calculus
Grishin ([10]) proposed enriching the Lambek calculus with multiplicative disjunction (par) and coresiduals. Applications to linguistics were discussed by Moortgat ([15]), who spok...
Arno Bastenhof
POPL
2008
ACM
14 years 7 months ago
Relevance heuristics for program analysis
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
Kenneth L. McMillan