Sciweavers

85 search results - page 7 / 17
» Planning texts by constraint satisfaction
Sort
View
JAIR
2000
94views more  JAIR 2000»
13 years 7 months ago
Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
Subbarao Kambhampati
CCIA
2005
Springer
14 years 29 days ago
A Preliminary Study on the Relaxation of Numeric Features in Planning
Modern AI planners use different strategies to simplify the complexity of current planning problems and turn them more affordable. In this paper, we present a new approach that div...
Antonio Garrido, Eva Onaindia, Donato Herná...
CI
2000
134views more  CI 2000»
13 years 7 months ago
Choosing Rhetorical Structures to Plan Instructional Texts
This paper discusses a fundamental problem in natural language generation: how to organize the content of a text in a coherent and natural way. In this research, we set out to det...
Leila Kosseim, Guy Lapalme
ACL
2001
13 years 8 months ago
Empirically Estimating Order Constraints for Content Planning in Generation
In a language generation system, a content planner embodies one or more "plans" that are usually hand
Pablo Ariel Duboué, Kathleen McKeown
IAT
2003
IEEE
14 years 21 days ago
Problem-solving in open environments
With the increasing use of the internet, many problemsolving tasks such as resource allocation, scheduling, planning, and configuration pose themselves in an open setting involvi...
Santiago Macho-Gonzalez, Boi Faltings