573 search results - page 25 / 115 » Sentence generation as a planning problem |
IJCAI
2007
13 years 10 months ago
2007
In this paper we propose a suite of techniques for planning with temporally extended preferences (TEPs). To this end, we propose a method for compiling TEP planning problems into ...
AIPS
2008
13 years 11 months ago
2008
Despite the recent resurgence of interest in learning methods for planning, most such efforts are still focused exclusively on classical planning problems. In this work, we invest...
FOSSACS
2009
Springer
14 years 3 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
ICTAI
2005
IEEE
14 years 2 months ago
2005
IEEE
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...
ECML
2006
Springer
14 years 9 days ago
2006
Springer
Automatically acquiring control-knowledge for planning, as it is the case for Machine Learning in general, strongly depends on the training examples. In the case of planning, examp...