128 search results - page 17 / 26 » Tractable Cover Compilations |
LPNMR
2009
Springer
15 years 7 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
145
click to vote
ATAL
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. Just as cooperation in multi-agent systems is a central issue for solving complex tasks, so too is the ability for an intelligent agent to reason about combined knowledge...
86
Voted
ECAI
1990
Springer
15 years 4 months ago
1990
Springer
Much recent work in computational morphology has presupposed that morphological operations are de nable on strings of phonological or graphemic objects. By contrast, theoretical l...
102
Voted
AUTOMATICA
2006
15 years 16 days ago
2006
In this note we consider the following problem. Suppose a set of sensors is jointly trying to estimate a process. One sensor takes a measurement at every time step and the measure...
102
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...