1021 search results - page 6 / 205 » Concepts in Proof Planning |
AIPS
2004
13 years 10 months ago
2004
We show that for conditional planning with partial observability the existence problem of plans with success probability 1 is 2-EXP-complete. This result completes the complexity ...
KI
2008
Springer
13 years 8 months ago
2008
Springer
We describe a method for cascading Description Logic (DL) representation and reasoning on the one hand, and HTN action planning on the other. The planning domain description as wel...
CADE
2003
Springer
14 years 8 months ago
2003
Springer
This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the stron...
IJCAI
1993
13 years 10 months ago
1993
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
ECAI
2000
Springer
14 years 27 days ago
2000
Springer
The integration of constraint solvers into proof planning has pushed the problem solving horizon. Proof planning benefits from the general functionalities of a constraint solver s...