2214 search results - page 148 / 443 » Complexity of Reasoning |
109
click to vote
ICLP
1997
Springer
15 years 7 months ago
1997
Springer
Array updates in single assignment languages generally require some copying of the array, and thus tend to be more expensive than in imperative languages. As a result, programs in...
201
Voted
DEON
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In this paper, we present an adaptive logic for deontic conflicts, called P2.1r , that is based on Goble’s logic SDLaPe—a bimodal extension of Goble’s logic P that...
122
click to vote
JMLR
2006
15 years 3 months ago
2006
In many pattern recognition/classification problem the true class conditional model and class probabilities are approximated for reasons of reducing complexity and/or of statistic...
122
Voted
BIRTHDAY
2005
Springer
15 years 9 months ago
2005
Springer
In this paper we present an overview of recent developments in the plan-based control of autonomous robots. We identify computational principles that enable autonomous robots to a...
104
click to vote
LICS
2008
IEEE
15 years 10 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...