RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion

[No abstract available

RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion

Theory and experimentation are two roots common to many scientific disciplines such as Physics, Medicine, and Computer Science. In all these disciplines theory and experimentation are tightly intertwined: they grow together and together make Science progress and evolve. Computer science is often faced with problems of combinatorial nature which are studied in the NP- completeness theory. For those problems, in many cases, experiments help us to point-out interesting phenomena and to derive efficient solutions. Rappresentazione della Conoscenza e Ragionamento Automatico (RCRA, rcra.aixia.it) is a scientific community interested in Knowledge Representation and Automated Reasoning. It is part of the Italian Association for Artificial Intelligence (AI*IA, www.aixia.it). In the last few years, the yearly workshop of RCRA was devoted to the experimental evaluation of algorithms with very large search space. In this issue we present a selection of the papers presented in the 2009 edition, held in Reggio Emilia (Italy) the 11th and 12th of December in conjunction with the XI conference of AI*IA. Beside organizing the workshop, RCRA was responsible for one session of the conference. 14 papers were presented at the workshop, and 4 papers were selected for the RCRA session at the AI*IA conference. The authors of these 18 papers were invited to submit an extended version of their article for possible publication in this special issue, and, after a further selection and two rounds of reviews, eight articles have been accepted