2040 search results - page 5 / 408 » On the Complexity of Error Explanation |
AIPS
2006
13 years 9 months ago
2006
Classical planning algorithms require that their operators be simple in order for planning to be tractable. However, the complexities of real world domains suggest that, in order ...
AADEBUG
2000
Springer
14 years 1 days ago
2000
Springer
This work is devoted to constraint solving motivated by the debugging of constraint logic programs a la GNU-Prolog. The paper focuses only on the constraints. In this framework, c...
AADEBUG
1995
Springer
13 years 11 months ago
1995
Springer
Novice programmers often find programming to be a difficult and frustrating task. Because of their lack of experience in programming novices have different needs to experts when i...
EXACT
2009
13 years 5 months ago
2009
In this paper a representative example is chosen that is meant be fairly simple for illustrating the point that in a very common kind of instance, argument and explanation are mixe...
IAT
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...