Programa, xerrades, activitats i articles acceptats
Xerrades convidades
Christian Bessière.
Global Constraints in Constraint programming
Constraint propagation is a key feature in constraint programming. In the last 15 years, global constraints became an essential component of constraint programming because they often allow stronger propagation. There is a catalog that contains more than 300 global constraints. We will show that, surprisingly, for many of those constraints, reasoning on a decomposition into simple fixed-arity constraints achieves the same level of propagation. But we found global constraints that express a non decomposable property. This means that for these constraints, no decomposition in fixed-arity constraints is able to propagate as much as the original global constraint. This result of non-decomposability also holds for decompositions in SAT, using the well-known direct encoding translation.
Going Beyond NP: New Challenges in Inference Technology
In recent years, we have seen tremendous progress in inference technologies. For example, in the area of Boolean satisfiability (SAT) and Mixed Integer Programming (MIP) solvers now enable us to tackle significant practical problem instances with up to a million variables and constraints. Key to this success is the ability to strike the right balance between the expressiveness of the underlying representation formalism and the efficiency of the solvers. The next challenge is to extend the reach of these solvers to more complex tasks that lie beyond NP. I will discuss our work on sampling, counting, probabilistic reasoning, and adversarial reasoning. In particular, I will discuss a new sampling technique based on the so-called flat histogram method, from statistical physics. The technique allows for fast probabilistic inference and learning in Markov Logic networks and other graphical models. In the area of adversarial reasoning, the UCT method, based on sampling strategies first developed for use in multi-armed bandit scenarios, provides a compelling alternative to traditional minimax search. The method has led to an exciting advance in the strength of GO programs. I'll discuss insights into the surprising effectiveness of the UCT technique.
Articles acceptats
Programa detallat
|
Actes
|
Esquema del programa
Dia 1. 26/10/2011
- 15:00 Registre
- 15:30 Inauguració del congrés
- 15:45 - 16:45 Sessió 1: Robòtica i visió artificial
- 16:45 - 17:00 Pausa cafè
- 17:00 - 18:00 Sessió 2 Robòtica i visió artificial
- 18:15 - 18:45 Premi ACIA
- 19:15 Visita al Museu de Lleida
Dia 2. 27/10/2011
- 9:45 - 11:00 Xerrada convidada. Bart Selman
- 11:15 - 12:15 Sessió 3: Sistemes multiagent
- 12:15 - 12:30 Pausa cafè
- 12:30 - 13:30 Sessió 4: Negociació i argumentació
- 13:30 Dinar
- 15:30 - 17:10 Sessió 5: Satisfacció de restriccions, cerca i optimització
- 17:10 - 17:25 Pausa cafè
- 17:25 - 18:25 Sessió 6: Aprenentatge automàtic i mineria de dades
- 18:30 - 19:30 Assemblea ACIA
- 20:00 - 21:30 Visita a la Seu Vella
- 21:30 Sopar del congrés
Dia 3. 28/10/2011
- 9:45 - 11:00 Xerrada convidada. Christian Bessière
- 11:00 - 12:35 Sessió 7: Aprenentatge automàtic i mineria de dades
- 12:35 - 12:45 Pausa cafè
- 12:45 - 13:45 ACIA. Programa de doctorat
- 13:45 - 14:00 Demostracions de l'ACIA a l'ECAI-2012
- 14:00 Cloenda
dates importants
- Data límit per l’enviament d’articles:
12 de maig de 2011
19 de maig de 2011 - Notificació d'acceptació:
22 de juny de 2011 - Data límit per a l'enviament de les versions finals dels articles:
15 de juliol de 2011 - Data límit pel registre amb preus reduïts:
27 de juliol de 2011 - Congrés:
26-28 d’octubre de 2011
