Sciweavers

1146 search results - page 6 / 230
» On the Complexity of Domain-Independent Planning
Sort
View
AAAI
2012
11 years 10 months ago
The Complexity of Planning Revisited - A Parameterized Analysis
The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (B¨ackstr¨om and Nebel) have influenced followin...
Christer Bäckström, Yue Chen, Peter Jons...
AAAI
2012
11 years 10 months ago
Width and Complexity of Belief Tracking in Non-Deterministic Conformant and Contingent Planning
It has been shown recently that the complexity of belief tracking in deterministic conformant and contingent planning is exponential in a width parameter that is often bounded and...
Blai Bonet, Hector Geffner
ANLP
1992
81views more  ANLP 1992»
13 years 9 months ago
Portable Natural Language Generation using SPOKESMAN
1 This paper reports on the SPOKESMAN natural language generation system, which is a domain independent text generator designed to incrementally produce text for an underlying appl...
Marie Meteer
AAAI
2004
13 years 9 months ago
Assessing the Complexity of Plan Recognition
This paper presents a discussion of the theoretical complexity of plan recognition on the basis of an analysis of the number of explanations that any complete plan recognition alg...
Christopher W. Geib
AIPS
2006
13 years 9 months ago
New Complexity Results for Classical Planning Benchmarks
The 3rd and 4th International Planning Competitions have enriched the set of benchmarks for classical propositional planning by a number of novel and interesting planning domains....
Malte Helmert