121 search results - page 15 / 25 » Diagnosis as Planning Revisited |
168
Voted
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We address the problem of extracting Minimal Unsatisfiable Cores (MUCs) from constraint networks. This computationally hard problem has a practical interest in many appli...
176
click to vote
SCAI
2008
15 years 8 months ago
2008
We propose a troubleshooting algorithm that can troubleshoot systems with dependent action costs. When actions are performed they may change the way the system is decomposed and af...
171
click to vote
UAI
2008
15 years 8 months ago
2008
Approximate inference in dynamic systems is the problem of estimating the state of the system given a sequence of actions and partial observations. High precision estimation is fu...
170
click to vote
VMV
2004
15 years 8 months ago
2004
In this paper we describe methods to efficiently visualize multiple intersecting volumetric objects. We introduce the concept of V-Objects. V-Objects repbstract properties of an o...
158
click to vote
AAAI
1997
15 years 8 months ago
1997
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...