CIE
2008
Springer
13 years 6 months ago
2008
Springer
We revisit the deterministic graphical games of Washburn. A deterministic graphical game can be described as a simple stochastic game (a notion due to Anne Condon), except that we ...
CIE
2008
Springer
13 years 6 months ago
2008
Springer
d abstract) John Longley Laboratory for Foundations of Computer Science School of Informatics, University of Edinburgh The King's Buildings, Mayfield Road Edinburgh EH9 3JZ, U...
CIE
2008
Springer
13 years 6 months ago
2008
Springer
The values of a two-player zero-sum binary discounted game are characterized by a P-matrix linear complementarity problem (LCP). Simple formulas are given to describe the data of t...
CIE
2008
Springer
13 years 6 months ago
2008
Springer
CIE
2008
Springer
13 years 6 months ago
2008
Springer
CIE
2008
Springer
13 years 6 months ago
2008
Springer
Approximate Herbrand theorems are established for first-order fuzzy logics based on continuous t-norms, and used to provide proof-theoretic proofs of Skolemization for their Prenex...
CIE
2008
Springer
13 years 6 months ago
2008
Springer
CIE
2008
Springer
13 years 6 months ago
2008
Springer
The first extensive number-theoretical computation run on the world's first U.S. digital general-purpose electronic computer, the ENIAC, is reconstructed. The problem, computi...
CIE
2008
Springer
13 years 6 months ago
2008
Springer
The extraction mechanism of Coq allows one to transform Coq proofs and functions into functional programs. We illustrate the behavior of this tool by reviewing several variants of ...
CIE
2008
Springer
13 years 6 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...