Conferenciantes Invitados

At the Intersection of Planning and Constraint Programming
Alexander Nareyek

AI CENTER, Carnegie Mellon University
Departamento Computer Science
Pittsburgh, PA 15213-3891. USA.

Resumen: General frameworks for formulating and solving search problems, like constraint programming, integer linear programming or propositional satisfiability, provide useful means to tackle planning problems. While usually not as efficient as specialized search techniques, general frameworks support a modular and flexible modeling, and readily available solvers already draw on a huge pool of research on search. This talk will give an overview of related planning approaches, placing special emphasis on constraint programming.

[Conferenciantes Invitados] [Noticias] [Enviar Articulos] [Programa] [Principal] [Fechas Importantes] [Comite de Programa] [Faq] [Peticion de Articulos]