|
AI Problem Solving Seminar
Barcelona, May 28, 29 and
30, 2003
-
Aims and Scope
-
Speakers
-
Program
-
Organization
-
Location
-
Registration
-
Language
-
Pictures
Aims and Scope
The AI Problem Solving Seminar is
an informal meeting of Artificial Intelligence researchers in Spain, working
on technical aspects of Problem Solving. The main goal is to promote research
on this area and to improve communication among researchers. The Seminar
focuses on the following topics:
-
heuristic search
-
constraint processing
-
satisfiability
-
planning
The Seminar runs for two and a half days. It starts on May 28th in the
afternoon (to allow people from abroad to arrive in the morning) and ends
on May 30th. It includes four invited talks and a number of regular presentations.
In addition, a doctoral session is scheduled for the last day, where PhD
students and young postdocs can present their work in progress. The atmosphere
will be relaxed with plenty of time for informal exchanges.
Invited Speakers
-
Peter van Beek,
University of Waterloo, Canada
-
Enrico Giunchiglia,
Università di Genova, Italy
-
Richard Korf,
University of California, USA
-
François Laburthe,
Bouygues, France
Program
| Wednesday Afternoon |
Session on SAT |
| 16:00 - 17:00 |
Invited talk
Enrico Giunchiglia, Università
di Genova
SAT
and Beyond SAT |
| 17:00 - 17:30 |
Coffee Break |
| 17:30 - 18:00 |
Álvaro del Val, Universidad
Autónoma de Madrid
Applications of consequence-finding in automated reasoning |
| 18:00 - 18:30 |
Felip Manyà, Universitat
de Lleida
Many-Valued Satisfiability: Bridging
the gap between CSP and SAT |
| 18:30 - 19:00 |
Hector Geffner, ICREA -
Universitat Pompeu Fabra
Lower Bounds in Planning, Constraints,
and Propositional Inference |
|
|
| Thursday May 29, Morning |
Session on Constraints |
| 10:00 - 11:00 |
Invited talk
Peter van Beek, University of Waterloo
Constraint Programming for Compiler
Optimization |
| 11:00 - 11:30 |
Coffee Break |
| 11:30 - 12:00 |
Javier Larrosa, Universitat Politècnica
de Catalunya
On soft arc consistency in weighted
CSP |
| 12:00 - 12:30 |
Federico Barber, Universidad
Politécnica de Valencia
Algorithms for Contiuous Non-binary
Disjunctive CSPs |
| 12:30 - 13:00 |
Pedro Meseguer, IIIA-CSIC
Asynchronous Backtracking for
Distributed CSPs |
|
|
| Thursday May 29, Afternoon |
Session on Constraints |
| 16:00 - 17:00 |
Invited talk
François Laburthe, Bouygues
On the use of constraints
for exploring catalogs |
| 17:00 - 17:30 |
Coffee Break |
| 17:30 - 18:00 |
Carme Torras, IRI (CSIC-UPC)
A Branch-and-Prune Algorithm for
Solving Systems of Distance Constraints |
| 18:00 - 18:30 |
Ramón Béjar, Universitat
de Lleida
Easy and Hard instances of CSP
problems |
| 18:30 - 19:00 |
Victor Dalmau, Universitat Pompeu Fabra
Consistency, pebble games and obstruction
sets |
|
|
| Friday May 30, Morning |
Session on Search and Planning |
| 10:00 - 11:00 |
Invited talk
Richard Korf, University of California
Frontier Search and Pattern Databases |
| 11:00 - 11:30 |
Coffee Break |
| 11:30 - 12:00 |
Eva Onaindía, Universidad
Politécnica de Valencia
Temporal Planning and Plan Decomposition |
| 12:00 - 12:30 |
Daniel Borrajo, Universidad
Carlos III de Madrid
Some Approaches to Learning
in Problem Solving |
| 12:30 - 13:00 |
Luis Castillo, Universidad
de Granada
Assisted Design of Forest Fire
Fighting Plans by means of AI Planning Techniques |
|
|
| Friday May 30, Afternoon |
Doctoral Session: Constraints, SAT and Planning |
| 16:00 - 17:00 |
Iván Dotu, Universidad Autónoma
de Madrid
Redundant Modelling in the QuasiGroup
Completion Problem
Diego Moya, Universidad Autónoma
de Madrid
An adaptive algorithm for Constraint
Satisfaction Problems
Martí Sánchez, IIIA-CSIC
Mezclando Búsqueda y Programación Dinámica
para Resolver SoftCSP
Ismel Brito, IIIA-CSIC
Confidencialidad en Satisfacción
de Restricciones Distribuida |
| 17:00 - 18:00 |
Nelson Becerra, IIIA-CSIC
Trabajo Introductorio en el Esquema de
Davis-Putnam
Carlos Ansótegui, Universitat
de Lleida
Solving Many-Valued SAT Encodings of Combinatorial
Problems
Jordi Planes, Universitat de Lleida
Improved Branch and Bound Algorithms
for Max-SAT and Weighted Max-SAT
M. Dolores Rodriguez, Universidad de
Alcalá de Henares
Hybrid Razoner System |
| 18:00 - 19:00 |
Antonio Garrido, Universidad Politécnica
de Valencia
Planificación
Temporal en Grafos de Planificación
Oscar Sapena, Universidad Politécnica
de Valencia
Planificación Independiente
del Dominio en Entornos Dinámicos
Laura Sebastiá, Universidad Politécnica
de Valencia
Descomposición de Problemas
en Planificación y su Resolución Concurrente
Susana Fernandez, Universidad Carlos
III de Madrid
Aprendizaje y Planificación:
EBL en un Planificador Híbrido HTN-POP |
Organization
The AI Problem Solving Seminar is
organized by
The Seminar is funded by the UPF Doctoral
Program on Computer Science and Digital Communication, the RNSPT
(Red Nacional de Secuenciación,
Planificación y Razonamiento Temporal), and the REPLI
project (TIC2002-04470-C03).
Location
The Seminar will take place in Barcelona.
It is hosted by the Universitat Pompeu Fabra,
at the following location:
Edifici França, Auditori,
Passeig de Circumval·lació, 8
08003 Barcelona
Tel: (+34) 93 542 21 73 (secretariat)
Next to Estació de França; closest Metro Station: Barceloneta,
Line 4 (Yellow); closest stop Bus 14.
Registration
Registration is open to students and researchers, no fee is required.
Nevertheless, organizers request potential attendees to send them an e-mail
in advance expressing their interest in attending.
Language
The talks in the Seminar will be in English (unless otherwise noted).
Pictures
During a presentation, at
lunch time, enjoing dinner, at
the dessert.
|
