135
click to vote
LICS
15 years 7 months ago
2009 IEEE 
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...
LICS
15 years 7 months ago
2009 IEEE
Several dynamical systems, such as deterministic automata and labelled transition systems, can be described as coalgebras of so-called Kripke polynomial functors, built up from co...
132
click to vote
LICS
15 years 7 months ago
2009 IEEE
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...
116
Voted
LICS
15 years 7 months ago
2009 IEEE
mantics Is Fully Abstract∗ Sumit Nain and Moshe Y. Vardi Rice University, Department of Computer Science Houston, TX 77005-1892, USA The discussion in the computer-science liter...
LICS
15 years 7 months ago
2009 IEEE 
—We exhibit a deterministic concurrent reachability game PURGATORYn with n non-terminal positions and a binary choice for both players in every position so that any positional st...
|
Automated Reasoning