107 search results - page 4 / 22 » Planning and Patching Proof |
MKM
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In a problem solving process, a step may not result in the expected progress or may not be applicable as expected. Hence, knowledge how to overcome and react to impasses ...
BIRTHDAY
2000
Springer
15 years 4 months ago
2000
Springer
IJCAI
2003
15 years 1 months ago
2003
81
Voted
IJCAI
1989
15 years 26 days ago
1989
This paper describes an explanation-based approach lo learning plans despite a computationally intractable domain theory. In this approach, the system learns an initial plan using...
100
click to vote
CADE
2003
Springer
16 years 13 hour ago
2003
Springer
We describe the integration of permutation group algorithms with proof planning. We consider eight basic questions arising in computational permutation group theory, for which our ...