1021 search results - page 12 / 205 » Concepts in Proof Planning |
LICS
2002
IEEE
14 years 1 months ago
2002
IEEE
We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We...
KR
1994
Springer
14 years 20 days ago
1994
Springer
A key problem in case-based reasoning is the representation, organization and maintenance of case libraries. While current approaches rely on heuristic and psychologically inspire...
ICRA
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract— We present a proof for the probabilistic completeness of RRT-based algorithms when planning with constraints on end-effector pose. Pose constraints can induce lowerdime...
AIPS
1996
13 years 10 months ago
1996
Weintroduce a method of deduction-based refinement planning where prefabricated general solutions are adapted to special problems. Refmementproceeds by stepwise transforming nonco...
AIPS
2006
13 years 10 months ago
2006
We describe a domain-independent framework for plan summarization and comparison that can help a human understand both the key elements of an individual plan and important differe...