4595 search results - page 179 / 919 » Reasoning about Plans |
201
click to vote
AAAI
2006
15 years 8 months ago
2006
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
188
click to vote
WSC
1997
15 years 8 months ago
1997
One of the key issues in reasoning with multiple interacting intelligent agents is how to model and code the decision making process of the agents. In Artificial Intelligence (AI...
197
click to vote
AIPS
2010
15 years 7 months ago
2010
Over the last few years there has been a revival of interest in the idea of least-commitment planning with a number of researchers returning to the partial-order planning approach...
216
click to vote
FLAIRS
2009
15 years 5 months ago
2009
In this paper, we investigate the hypothesis that plan recognition can significantly improve the performance of a casebased reinforcement learner in an adversarial action selectio...
168
click to vote
LPNMR
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We describe the development of a constraint logic programming based system, called CPP, which is capable of generating most preferred plans with respect to a user’s pre...