RCRA
2007
program
| 09:50 | 10:00 | Welcome | ||||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 10:00 | 11:00 | Invited Talk
Satisfiability-Based Model Checking Algorithms | ||||||||||||||||||||||||||||||||||||
| 11:00 | 11:30 | coffee break | ||||||||||||||||||||||||||||||||||||
| SAT 1 | ||||||||||||||||||||||||||||||||||||||
| 11:30 | 11:55 | Enrico
Giunchiglia and Marco Maratea Exploiting optimizations in SAT-based planning: minimal-#actions plans and ""soft"" goals 11:55 | 12:20 | Marco Gavanelli | The log-support encoding of CSP into SAT 12:20 | 12:45 | Gilles Audemard, Said Jabbour, and Lakhdar Sais | Using Graph-Based Representation to Derive Hard SAT instances 12:45 | 14:15 | lunch
| CP and CSP | 14:15 | 14:40 | Richard J. Wallace and Diarmuid Grimes | Experimental Studies of Variable Selection Strategies Based on ConstraintWeights 14:40 | 15:05
| Meritxell Vinyals, Andrea Giovannucci, Jesus Cerquides, Pedro
Meseguer, and Juan Antonio Rodriguez-Aguilar | Towards a Realistic Bid Generator for Mixed Multi-Unit Combinatorial Auctions 15:05 | 15:30 | Zeynep Kiziltan, Andrea Lodi, Michela Milano, and Fabio Parisini | CP-based Local Branching 15:30 |
16:00 | coffee break
| Local Search | 16:00 | 16:15 | Luca Di Gaspero, Barry McCollum, and Andrea Schaerf | The Second International Timetabling Competition (ITC-2007): Curriculum-based Course Timetabling Track 16:15 | 16:35 | Luca Di Gaspero and Andrea Roli | Metaheuristics for the Haplotype Inference Problem: a preliminary analysis 16:35 | 17:00 | Angelo Oddi, Nicola Policella, Amedeo Cesta, and Stephen F. Smith | Comparing Iterative Improvement Heuristics for Multi-Capacity Scheduling Problems |
| ASP | |||||||||||||||||||||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 10:00 | 10:25 | Wolfgang Faber, Nicola Leone, Marco Maratea, and Francesco Ricca Look-Back Techniques and Heuristics in DLV: Implementation and Evaluation 10:25 | 10:50 | F. Calimeri, S. Perri, and F. Ricca | Experimenting with Parallelism for the Instantiation of ASP Programs 11:00 | 11:30 | coffee break
| SAT 2 | 11:30 | 11:55 | Daniel Singer and Anthony Monnet | A New Decomposition Scheme for Parallel Resolution of the Satisfiability Problem (SAT) 11:55 | 12:15 | Daniel Le Berre and Anne Parrain | On extending SAT solvers for PB problems 12:15 | 12:40 | Ruben Martins and Ines Lynce | Breaking Local Symmetries in Quasigroup Completion Problems 12:40 | 14:10 | lunch
| SAT 3 | 14:10 | 14:35 | Matti Jarvisalo | The Effect of Structural Branching on the Efficiency of Clause Learning SAT Solving 14:35 | 15:00 | Richard J. Wallace and Stuart Bain | Branching Rules for Satisfiability Analysed with Factor Analysis 15:00 | 15:25 | Luca Pulina and Armando Tacchella | Harnessing Machine Learning techniques to build a robust solver for quantified Boolean formulas 15:25 | 15:55
| coffee break
| Agents and logic programming | 15:55 | 16:20 | Fabrizio Riguzzi | A Top Down Interpreter for LPAD and CP-logic 16:20 | 16:45 | Chris Child and Kostas Stathis | Learning to Act with RVRL Agents 16:45 | 17:10 | Stefania Costantini, Arianna Tocchio, and Panagiota Tsintza | Experimental Evaluation of a Heuristic Approach for P2P Negotiation 17:10 | 17:35 | Annual RCRA meeting and election of coordinator | |
RCRA
2007