371 search results - page 42 / 75 » Partition Theorems and Computability Theory |
79
Voted
TLCA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
RANDOM
1997
Springer
15 years 1 months ago
1997
Springer
Most research on resource-bounded measure and randomness has focused on the uniform probability density, or Lebesgue measure, on {0, 1}∞ ; the study of resource-bounded measure ...
ECAI
1992
Springer
15 years 1 months ago
1992
Springer
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
64
Voted
STOC
2006
ACM
15 years 10 months ago
2006
ACM
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
ACTA
2007
14 years 9 months ago
2007
In this paper we provide a bridge between the infinite state models used in control theory to describe the evolution of continuous physical processes and the finite state models ...