201 search results - page 14 / 41 » Reconstructive Explanation: Explanation as Complex Problem S... |
UAI
1996
13 years 9 months ago
1996
Probabilistic inference algorithms for belief updating, nding the most probable explanation, the maximum a posteriori hypothesis, and the maximum expected utility are reformulated...
CAV
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. When a model does not satisfy a given specification, a counterexample is produced by the model checker to demonstrate the failure. A user must then examine the counterexa...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
RC
1998
13 years 7 months ago
1998
In computer and electronic manufacturing, it is very important to be able to automatically check whether the surface mounted devices (SMD) are correctly placed on the printed circ...
LPAR
2005
Springer
14 years 1 months ago
2005
Springer
We propose to build an automated reasoning system for first-order logic (FOL) by translating reasoning problems to a fragment of FOL called coherent logic (CL) and then solving t...