4617 search results - page 638 / 924 » Automation of Diagrammatic Reasoning |
158
click to vote
CSL
2007
Springer
16 years 1 months ago
2007
Springer
Recently it has been shown that the miniaturization mapping M faithfully translates subexponential parameterized complexity into (unbounded) parameterized complexity. We determine...
170
click to vote
CSL
2007
Springer
16 years 1 months ago
2007
Springer
We show how to extract classical programs expressed in Krivine λc-calculus from proof-terms built in a proof-irrelevant and classical version of the calculus of constructions with...
170
click to vote
CSL
2007
Springer
16 years 1 months ago
2007
Springer
We give a fully abstract game model for Idealized Algol with non-local control flow. In contrast to most previous papers on game semantics, we do not need to include the bad-varia...
175
click to vote
ECSQARU
2007
Springer
16 years 1 months ago
2007
Springer
The binary representation is widely used for representing focal sets of Dempster-Shafer belief functions because it allows to compute efficiently all relevant operations. However, ...
169
click to vote
ECSQARU
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. The issue of formalizing skepticism relations between argumentation semantics has been considered only recently in the literature. In this paper, we contribute to this ki...