Friday, 11 Dec 2009
|
|
|
| 10:50 | 11:20 | Enrico Giunchiglia and Marco Maratea | Improving plan quality in SAT‐based planning |
| 11:20 | 11:50 | Antti E.J. Hyvärinen, Tommi Junttila and Ilkka Niemelä | Partitioning Search Spaces of a Randomized Search |
| 11:50 | 12:20 | Michele Lombardi, Michela Milano, Andrea Roli and Alessandro Zanarini | Deriving information from sampling and diving |
| 12:20 | 12:50 | Marenglen Biba, Stefano Ferilli and Floriana Esposito | High Performing Algorithms for MAP and Conditional Inference in Markov Logic |
RCRA 2009: Experimental evaluation of algorithms for solving
problems with combinatorial explosion
|
| 16:00 | 16:05 | Welcome |
|
| Local search |
|
| 16:05 | 16:30 | Jun He, Pierre Flener, and Justin Pearson | An automaton Constraint for Local Search |
| 16:30 | 16:55 | Raffaele Cipriano, Luca Di Gaspero, and Agostino Dovier | A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal++ |
| 16:55 | 17:20 | Toni Mancini, Pierre Flener, Amir Hossein Monshi, and Justin Pearson | Constrained optimization over massive databases |
| 17:20 | 17:40 | Break
|
|
|
| Planning |
|
| 17:40 | 18:05 | Alfonso E. Gerevini, Alessandro Saetti, and Ivan Serina | An Empirical Analysis of Some Heuristic Features for Planning with Local Search in LPG |
| 18:05 | 18:30 | A. Cesta, A. Finzi, S. Fratini, A. Orlandini, and E. Tronci | Flexible Plan Verification: Feasibility Results |
Saturday, 12 Dec 2009
|
RiCeRcA 2009: RCRA Incontri e Confronti (in Italian) |
| 9:00 | 10:20 | Presentazioni brevi, sessione comune poster e demo
|
|
| 10:20 | 10:30 | Riunione del gruppo di lavoro RCRA (in Italian) |
| 10:30 | 11:00 | Coffee break |
|
RCRA 2009: Experimental evaluation of algorithms for solving
problems with combinatorial explosion
|
|
| Constraint Satisfaction and ASP |
|
| 11:00 | 11:25 | Inês Lynce and Joao Marques-Silva | Restoring CSP Satisfiability with MaxSAT |
| 11:25 | 11:50 | | |
| 11:50 | 12:15 | Mehmet Çelik, Halit Erdogan, Fırat Tahaoglu, Tansel Uras, and
Esra Erdem
| Comparing ASP and CP on Four Grid Puzzles |
| 12:15 | 12:40 | Simona Perri, Francesco Ricca, and Marco Sirianni | Advanced Heuristics for Parallel ASP Instantiation |
| 12:40 | 14:45 | Lunch break
|
|
|
| QBF & Model checking |
|
| 14:45 | 15:10 | Paolo Marin, Matthew Lewis, Tobias Schubert, Massimo Narizzano,
Bernd Becker, and Enrico Giunchiglia
| Evaluation of Knowledge Sharing Strategies in a Parallel QBF Solver |
| 15:10 | 15:35 | Luca Pulina and Armando Tacchella | A structural approach to reasoning with quantified Boolean formulas |
| 15:35 | 16:00 | Damiano Angeletti, Enrico Giunchiglia, Massimo Narizzano,
Gabriele Palma, Alessandra Puddu, and Salvatore Sabina
| Improving the Automatic Test Generation process for Coverage Analysis using CBMC |
| 16:00 | 16:30 | Coffee break
|
|
|
| Applications |
|
| 16:30 | 16:55 | Fabio Massimo Zanzotto and Lorenzo dell'Arciprete | Efficient Kernels for Sentence Pair Classification |
| 16:55 | 17:20 | Angel A. Juan, Scott E. Grasman, Javier Faulin, Daniel Riera, and
Carlos A. Méndez
| Applying Simulation and Reliability to Vehicle Routing Problems with Stochastic Demands |
| 17:20 | 17:45 | Toni Mancini | Negotiation exploiting reasoning by projections |
