186 search results - page 12 / 38 » Tractability of Theory Patching |
100
click to vote
ECIS
2001
14 years 11 months ago
2001
Despite evidence that the majority of knowledge management (KM) initiatives miscarry, there has been a paucity of critical, in-depth research into the causes of failure. In this p...
IJCAI
2003
14 years 11 months ago
2003
Refinement operators for theories avoid the problems related to the myopia of many relational learning algorithms based on the operators that refine single clauses. However, the n...
105
click to vote
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
115
click to vote
IIR
2010
14 years 12 months ago
2010
In this work, we summarise the development of a ranking principle based on quantum probability theory, called the Quantum Probability Ranking Principle (QPRP), and we also provide...
IJCAI
1993
14 years 11 months ago
1993
This paper describes how meta-level theories are used for analytic learning in M U L T I - T A C . M U L T I - T A C operationalizes generic heuristics for constraint-satisfaction...