1322 search results - page 132 / 265 » Unsound Theorem Proving |
124
Voted
ISAAC
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
116
Voted
KI
2007
Springer
15 years 11 months ago
2007
Springer
With this talk we want to pay tribute to the late Professor Gerd Veenker who deserves the historic credit of initiating the formation of the German AI community. We present a summa...
147
click to vote
TYPES
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Proof erasure plays an essential role in the paradigm of programming with theorem proving. In this paper, we introduce a form of attributive types that carry an attribute...
131
click to vote
EPEW
2005
Springer
15 years 10 months ago
2005
Springer
webπ is a recent process calculus introduced to formally specify Web Services composition. It extends the π-calculus with timed workunits, namely an asynchronous and temporized m...
162
Voted
LPAR
2005
Springer
15 years 10 months ago
2005
Springer
We investigate some syntactic properties of Wadler’s dual calculus, a term calculus which corresponds to classical sequent logic in the same way that Parigot’s λµ calculus co...