186 search results - page 1 / 38 » Tractability of Theory Patching |
CORR
1998
Springer
13 years 8 months ago
1998
Springer
In this paper we consider the problem of theory patching, in which we are given a domain theory, some of whose components are indicated to be possibly awed, and a set of labeled t...
JCSS
2008
13 years 8 months ago
2008
In this paper we derive a generic form of structural decomposition for the constraint satisfaction problem, which we call a guarded decomposition. We show that many existing decom...
ALDT
2009
Springer
14 years 3 months ago
2009
Springer
Most work in game theory is conducted under the assumption that the players are expected utility maximizers. Expected utility is a very tractable decision model, but is prone to w...
APAL
2007
13 years 8 months ago
2007
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...
COGSCI
2008
13 years 8 months ago
2008
The recognition that human minds/brains are finite systems with limited resources for computation has led some researchers to advance the Tractable Cognition thesis: Human cogniti...