{"id":425,"date":"2015-03-23T13:56:30","date_gmt":"2015-03-23T12:56:30","guid":{"rendered":"http:\/\/aixia2015.unife.it\/?page_id=425"},"modified":"2019-07-04T11:54:55","modified_gmt":"2019-07-04T10:54:55","slug":"rcra","status":"publish","type":"page","link":"https:\/\/aixia2015.unife.it\/events\/rcra\/","title":{"rendered":"22nd RCRA International Workshop on \u201cExperimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion\u201d (RCRA 2015)"},"content":{"rendered":"
Many problems in Artificial Intelligence show an exponential explosion of the search space. Although stemming from different research areas, such problems are often addressed with algorithms that have a common goal: the effective exploration of huge state spaces. Many algorithms developed in one research area are applicable to other problems, or can be hybridised with techniques in other areas. Artificial Intelligence tools often exploit or hybridise techniques developed by other research communities, such as Operations Research.
\nIn recent years, research in Artificial Intelligence has more and more focused on experimental evaluation of algorithms, the development of suitable methodologies for experimentation and analysis, the study of languages and the implementation of systems for the definition and solution of problems.<\/p>\n
The aim of the workshop is fostering the cross-fertilisation of ideas stemming from different areas, proposing benchmarks for new challenging problems, comparing models and algorithms from an experimental viewpoint, and, in general, comparing different approaches with respect to efficiency, problem modelling, and ease of development.<\/p>\n
Topics of interest include, but are not limited to:<\/p>\n
Official Web Page:<\/strong>\u00a0http:\/\/rcra.aixia.it\/rcra2015<\/a><\/p>\n For general information about paper submission instructions, please refer to the Call for Papers<\/a>\u00a0page.<\/p>\n RCRA will be held in Room<\/strong>\u00a05\u00a0<\/strong>- Ground\u00a0Floor, Palazzo Trotti Mosti\u00a0<\/em>(Trotti Mosti Palace): Corso Ercole I d'Este, 37 - Building Plan<\/a><\/p>\n The program is downloadable here<\/a>.<\/p>\n <\/p>\n Stefano Bistarelli<\/a> Andrea Formisano<\/a> Marco Maratea<\/a> (contact person)<\/em>Program<\/h2>\n
\n\n
\n <\/th>\n 22 September 2015<\/strong><\/th>\n <\/th>\n<\/tr>\n<\/thead>\n \n\n <\/td>\n <\/td>\n <\/td>\n<\/tr>\n \n 09.25-09.40<\/td>\n Opening Remarks<\/td>\n <\/td>\n<\/tr>\n \n Session I<\/strong><\/td>\n (Q) and (Max) SAT (Chair: Toni Mancini)<\/strong><\/td>\n <\/td>\n<\/tr>\n \n 09.40-10.05<\/td>\n A MaxSAT Algorithm Using Cardinality Constraints of Bounded Size<\/em><\/td>\n Mario Alviano, Carmine Dodaro and Francesco Ricca<\/td>\n<\/tr>\n \n 10.05-10.30<\/td>\n An Empirical Perspective on Ten Years of QBF Solving<\/em><\/td>\n Paolo Marin, Massimo Narizzano, Luca Pulina, Armando Tacchella and Enrico Giunchiglia<\/td>\n<\/tr>\n \n Coffee break<\/strong><\/td>\n <\/td>\n <\/td>\n<\/tr>\n \n Session II<\/strong><\/td>\n Answer Set Programming (Chair: Agostino Dovier)<\/strong><\/td>\n <\/td>\n<\/tr>\n \n 11.00-11.20<\/td>\n Modeling Abduction over Acyclic First-Order Logic Horn Theories in Answer Set Programming: Preliminary Experiments<\/em><\/td>\n Peter Sch\u00fcller<\/td>\n<\/tr>\n \n 11.20-11.40<\/td>\n Evaluating Answer Set Programming with Non-Convex Recursive Aggregates<\/td>\n Mario Alviano<\/td>\n<\/tr>\n \n 11.40-12.00<\/td>\n Fuzzy Answer Set Computation via Satisfiability Modulo Theories<\/td>\n Mario Alviano and Rafael Pe\u00f1aloza<\/td>\n<\/tr>\n \n 12.00-12.20<\/td>\n JWASP: A New Java-Based ASP Solver<\/td>\n Mario Alviano, Carmine Dodaro and Francesco Ricca<\/td>\n<\/tr>\n \n Lunch break<\/strong><\/td>\n <\/td>\n <\/td>\n<\/tr>\n \n Session III<\/strong><\/td>\n Planning (Chair: Peter Sch\u00fcller)<\/strong><\/td>\n <\/td>\n<\/tr>\n \n 14.30-14.50<\/td>\n Planning with Always Preferences by Compilation into STRIPS with Action Costs<\/em><\/td>\n Luca Ceriani and Alfonso Gerevini<\/td>\n<\/tr>\n \n 14.50-15.10<\/td>\n ASCoL: a Tool for Improving Automatic Planning Domain Model Acquisition<\/em><\/td>\n Rabia Jilani, Andrew Crampton, Diane Kitchin and Mauro Vallati<\/td>\n<\/tr>\n \n 15.10-15.30<\/td>\n Searching for Sequential Plans Using Tabled Logic Programmin<\/em><\/td>\n Roman Bartak and Jind\u0159ich Vodr\u00e1\u017eka<\/td>\n<\/tr>\n \n 15.30-15.50<\/td>\n Identifying and Exploiting Features for Effective Plan Retrieval in Case-Based Planning<\/em><\/td>\n Mauro Vallati, Ivan Serina, Alessandro Saetti and Alfonso Emilio Gerevini<\/td>\n<\/tr>\n \n Coffee break<\/strong><\/td>\n <\/td>\n <\/td>\n<\/tr>\n \n Session IV<\/strong><\/td>\n Applications (Chair: Luca Pulina)<\/strong><\/td>\n <\/td>\n<\/tr>\n \n 16.30 - 16.50<\/td>\n Patient-Specific Models from Inter-Patient Biological Models and Clinical Records<\/em><\/td>\n Enrico Tronci, Toni Mancini, Ivano Salvo, Stefano Sinisi, Federico Mari, Igor Melatti, Annalisa Massini, Francesco Dav\u00ec, Thomas Dierkes, Rainald Ehrig, Susanna Roeblitz, Brigitte Leeners, Tillmann H. C. Kruger, Marcel Egli and Fabian Ille<\/td>\n<\/tr>\n \n 16.50 - 17.10<\/td>\n SyLVaaS: System Level Formal Verification as a Service<\/em><\/td>\n Toni Mancini, Federico Mari, Annalisa Massini, Igor Melatti and Enrico Tronci<\/td>\n<\/tr>\n \n 17.10 - 17.30<\/td>\n Now or Never: negotiating efficiently with unknown counterparts<\/em><\/td>\n Toni Mancini<\/td>\n<\/tr>\n \n 17.30 - 17.50<\/td>\n Testing Credulous and Sceptical Acceptance in Small-World Networks<\/em><\/td>\n Stefano Bistarelli, Fabio Rossi and Francesco Santini<\/td>\n<\/tr>\n \n 18:00 - 18:10<\/td>\n Closing<\/em><\/td>\n <\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n Organising Committee<\/h2>\n
\nUniversity of Perugia<\/p>\n
\nUniversity of Perugia<\/p>\n
\nUniversity of Genoa<\/p>\n