573 search results - page 6 / 115 » Sentence generation as a planning problem |
SCHEDULING
2010
13 years 7 months ago
2010
JAIR
2008
13 years 8 months ago
2008
Sentence compression holds promise for many applications ranging from summarization to subtitle generation. Our work views sentence compression as an optimization problem and uses...
PROPOR
2012
Springer
12 years 4 months ago
2012
Springer
Fill-in-the-blank questions are one of the main assessment devices in REAP.PT tutoring system. The problem of automatically generating the stems, i.e. the sentences that serve as b...
AAAI
2004
13 years 10 months ago
2004
Reactive planning using assumptions is a well-known approach to tackle complex planning problems for nondeterministic, partially observable domains. However, assumptions may be wr...
AIPS
2009
13 years 9 months ago
2009
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...