13603 search results - page 388 / 2721 » On the Computational Complexity of Cut-Reduction |
181
click to vote
KER
2008
15 years 7 months ago
2008
This article surveys existing practical implementations of both defeasible and argumentationbased reasoning engines and associated literature. We aim to summarise the current stat...
207
click to vote
EJC
2002
15 years 7 months ago
2002
Given a Newtonian coalgebra we associate to it a chain complex. The homology groups of this Newtonian chain complex are computed for two important Newtonian coalgebras arising in ...
190
click to vote
IFIPTCS
2010
15 years 5 months ago
2010
Abstract. We investigate systematically into the various possible notions of traceable sets and the relations they bear to each other and to other notions such as diagonally noncom...
214
click to vote
FCS
2009
15 years 5 months ago
2009
- A representation for a set is defined to be symmetric if the space required for the representation of the set is the same as the space required for representation of the set'...
232
click to vote
CIE
2007
Springer
16 years 1 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....