2178 search results - page 30 / 436 » Inferring complex plans |
AIPS
2006
13 years 10 months ago
2006
We study the consequences on complexity that arise when bounds on the number of branch points on the solutions for non-deterministic planning problems are imposed as well as when ...
RTA
2010
Springer
14 years 20 days ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
ECIS
2001
13 years 10 months ago
2001
The IT Plan is generally seen as a cornerstone of the IS/IT presence in an organisation. Researchers have outlined various approaches to IT planning and many have suggested catego...
AIPS
1998
13 years 10 months ago
1998
Casting planning problems as propositional satis ability problems has recently been shown to be an effective way of scaling up plan synthesis. Until now, the bene ts of this appro...
AAAI
2006
13 years 10 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 ...