[apologies for any cross-posting] ........................................................................ 4th OPEN Answer Set Programming Competition 2013 Call for Benchmark Problems University of Calabria - Vienna University of Technology Fall/Winter 2012/2013 http://aspcomp2013.mat.unical.it/ ........................................................................ The 4th Open Answer Set Programming Competition is open to ASP systems and *any other system* based on a declarative specification paradigm. The event is currently open and in the Call for Benchmarks stage. == Call for Benchmark Problems == Participants will compete on a selected collection of declarative specifications of benchmark problems, taken from a variety of domains as well as real world applications, and instances thereof. These include, but are not limited to: - Deductive database tasks on large data-sets - Sequential and Temporal Planning - Classic and Applicative graph problems - Puzzles and Combinatorics - Scheduling, Timetabling, and other resource allocation problems - Combinatorial Optimization Problems - Ontology reasoning - Automated Theorem Proving and Model Checking - Reasoning tasks over large propositional instances - Constraint Programming problems - Other AI problems We encourage to provide help by proposing and/or devising new challenging benchmark problems. The submission of problems arising from applications of practical impact are strongly encouraged; problems used in the former ASP Competitions, or variants thereof, can be re-submitted. Benchmark authors are expected to produce a problem specification and an instance set (or a generator thereof). The detailed benchmark problems submission procedure is available at: http://www.mat.unical.it/aspcomp2013/BenchmarkSubmission === About the ASP Competition Series === Answer Set Programming is a well-established paradigm of declarative programming with close relationship to other declarative modelling paradigms and languages, such as SAT Modulo Theories, Constraint Handling Rules, FO(.), PDDL, CASC, and many others. Since the first informal editions (Dagstuhl 2002 and 2005), ASP systems compare themselves in the nowadays customary ASP Competition: the 4th ASP Competition will be run jointly at the University of Calabria (Italy) and the Vienna University of Technology (Austria), in the first half of 2013. The event is the sequel to the ASP Competition series, held at the University of Potsdam (Germany) in 2006-2007, at the University of Leuven (Belgium) in 2009, and at University of Calabria (Italy) in 2011. The current competition takes place in cooperation with the 13th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013), where the results will be announced. The ASP competition is held as an open tournament. The "Model & Solve" competition track fosters the spirit of integration among communities, and is thus open to all types of solvers: ASP systems, SAT solvers, SMT solvers, CP systems, FOL theorem provers, Description Logics reasoners, planning reasoners, or any other. The "System" competition track is instead set up on a fixed language based on the answer set semantics. == Important Dates == * Problem selection stage Problem submission deadline: Aug 31th, 2012 * Competition stage "Model & Solve" submission deadline: Mar 1st, 2013 "System" submission deadline: Mar 1st, 2013 * Sep 15-19th, 2013 Announcement of results and awards at LPNMR 2013 - Corunna, Spain For further information please visit the competition web site http://aspcomp2013.mat.unical.it/ or contact us by email: aspcomp2013@kr.tuwien.ac.at.