13603 search results - page 180 / 2721 » On the Computational Complexity of Cut-Reduction |
205
click to vote
COCOA
2010
Springer
15 years 1 months ago
2010
Springer
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model...
163
click to vote
CSL
1999
Springer
15 years 11 months ago
1999
Springer
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
168
click to vote
ECML
1993
Springer
15 years 10 months ago
1993
Springer
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
193
click to vote
ARGMAS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this paper, we propose a new strategic and tactic reasoning for agent communication. This reasoning framework is specified using argumentation theory combined to a rel...
163
click to vote
MCU
2004
15 years 8 months ago
2004
Abstract. This paper provides a framework enabling to define and determine the complexity of various universal programs U for various machines. The approach consists of first defin...