#acl EditorsGroup:read,write All:read = Official Problem Suite = == Problem List - Model & Solve and System Track == <
> ||'''Nr''' ||'''Name''' ||'''Author(s)''' || '''Type''' || '''Complexity''' ||'''Domain''' || '''Problem Description''' ||'''Sample Instances''' || || N01 ||Permutation Pattern Matching || Martin Lackner, Andreas Pfandler || Search || NP || Combinatorial ||[[https://www.mat.unical.it/aspcomp2013/FinalProblemDescriptions/PermutationPatternMatching|view]] || || || N02 ||Valves Location Problem || Andrea Peano || Optimization || Beyond NP || Combinatorial ||[[https://www.mat.unical.it/aspcomp2013/FinalProblemDescriptions/ValvesLocation|view]] || [[https://www.mat.unical.it/aspcomp2013/files/samples/valves_location_problem-sample.zip|download]] || || N03 ||Rotating Workforce Scheduling || Francesco Calimeri, Thomas Krennwallner, Nysret Musliu || Search || || Scheduling || || || || N04 ||Connected Maximum-density Still Life || Christian Drescher || Optimization || Beyond NP || AI || [[https://www.mat.unical.it/aspcomp2013/ConnectedMaximumDensityStillLife|view]] || [[https://www.mat.unical.it/aspcomp2013/files/samples/still_life-sample.zip|download]] || || N05 || Graceful Graphs || Christian Drescher || Search || || Graph || [[https://www.mat.unical.it/aspcomp2013/GracefulGraphs|view]] || [[https://www.mat.unical.it/aspcomp2013/files/samples/graceful_graphs-sample.zip|download]] || || N06 ||Bottle Filling Problem || Wolfgang Faber || Search || || Combinatorial || [[https://www.mat.unical.it/aspcomp2013/BottleFillingProblem|view]] || [[https://www.mat.unical.it/aspcomp2013/files/samples/bottle_filling-sample.zip|download]] || || N07 ||Nomystery || Giovambattista Ianni, Carlos Linares López*, Hootan Nakhost* || Search || || Planning || [[https://www.mat.unical.it/aspcomp2013/Nomystery|view]] || [[https://www.mat.unical.it/aspcomp2013/files/samples/nomystery-sample.zip|download]] || || N08 ||Sokoban || Giovambattista Ianni, Wolfgang Faber*, Carlos Linares López* || Search || || Planning || [[https://www.mat.unical.it/aspcomp2013/Sokoban|view]] || [[https://www.mat.unical.it/aspcomp2013/files/samples/sokoban-sample.zip|download]] || || N09 || Ricochet Robots || Julius Höfler, Martin Gebser, Philipp Obermeier, Roland Kaminski, Torsten Schaub || Search || || Puzzle || [[https://www.mat.unical.it/aspcomp2013/RicochetRobot|view]] || || || O10 ||Crossing Minimization || Carmine Dodaro, Graeme Gange*, Peter Stuckey* || Optimization || Beyond NP || Graph || [[https://www.mat.unical.it/aspcomp2013/FinalProblemDescriptions/CrossingMinimization|view]] || [[https://www.mat.unical.it/aspcomp2013/files/samples/crossing_minimization-sample.zip|download]] || || O11 ||Reachability || Carmine Dodaro, Giorgio Terracina* || Query || P || Graph ||[[https://www.mat.unical.it/aspcomp2013/FinalProblemDescriptions/Reachability|view]] || || || O12 ||Strategic Companies || Mario Alviano, Marco Maratea*, Francesco Ricca* || Query || Beyond NP || AI || [[https://www.mat.unical.it/aspcomp2013/FinalProblemDescriptions/StrategicCompanies|view]] || [[https://www.mat.unical.it/aspcomp2013/files/samples/strategic_companies-sample.zip|download]] || || O13 ||Solitaire || Marcello Balduccini, Yuliya Lierler* || Search || NP || Puzzle || [[https://www.mat.unical.it/aspcomp2013/Solitaire|view]] || [[https://www.mat.unical.it/aspcomp2013/files/samples/solitaire_sample.zip|download]] || || O14 || Weighted-Sequence Problem || Marcello Balduccini, Yuliya Lierlier, Shaden Smith || Search || NP || Database || [[https://www.mat.unical.it/aspcomp2013/WeightedSequenceProblem|view]] || [[https://www.mat.unical.it/aspcomp2013/files/samples/weighted_sequence-sample.zip|download]] || || O15 ||Stable Marriage || Mario Alviano, Carmine Dodaro, Francesco Ricca || Search || P || Graph || [[https://www.mat.unical.it/aspcomp2013/StableMarriage|view]] || [[https://www.mat.unical.it/aspcomp2013/files/samples/stablemarriage-sample.zip|download]] || || O16 ||Incremental Scheduling || Marcello Balduccini, Yuliya Lierler* || Search || NP || Scheduling || [[https://www.mat.unical.it/aspcomp2013/IncrementalScheduling|view]] || [[https://www.mat.unical.it/aspcomp2013/files/samples/incremental_scheduling-sample.zip|download]] || == Problem List - System Track only == <
> ||'''Nr''' ||'''Name''' ||'''Author(s)''' || '''Type''' || '''Complexity''' ||'''Domain''' ||'''ASP-Core-2 Encoding''' || '''Problem Description''' ||'''Sample Instances''' || || N17 ||Qualitative Spatial Reasoning || Jason Jingshi Li || Search || NP || Formal logic || || [[https://www.mat.unical.it/aspcomp2013/FinalProblemDescriptions/QualitativeSpatialTemporalReasoning|view]] || || || N18 ||Chemical Classification || Despoina Magka || Search || P || Natural Sciences || || [[https://www.mat.unical.it/aspcomp2013/ChemicalClassification|view]] || [[https://www.mat.unical.it/aspcomp2013/files/samples/chemical_classification-sample.zip|download]] || || N19 ||Abstract Dialectical Frameworks Well-founded Model || Stefan Ellmauthaler, Johannes Wallner || Optimization || || Formal logic || || [[https://www.mat.unical.it/aspcomp2013/AbstractDialecticalFrameworks|view]] || [[https://www.mat.unical.it/aspcomp2013/files/samples/abstract_dialectical_frameworks-sample.zip|download]] || || N20 || Visit-all || Giovambattista Ianni,Nir Lipovetzky*, Carlos Linares López* || Search || || Planning || || [[https://www.mat.unical.it/aspcomp2013/VisitAll|view]] || || || N21 ||Complex Optimization of Answer Sets || Martin Gebser, Roland Kaminski, Torsten Schaub || Search || || Synthetic || || [[https://www.mat.unical.it/aspcomp2013/ComplexOptimizationAnswerSets|view]] || [[https://www.mat.unical.it/aspcomp2013/files/samples/complex_optimization-sample.zip|download]] || || O22 ||Knight Tour with Holes || Francesco Calimeri, Neng-Fa Zhou* || Search || NP || Puzzle || ||[[https://www.mat.unical.it/aspcomp2013/KnightTour|view]] || [[https://www.mat.unical.it/aspcomp2013/files/samples/knight_tour-sample.zip|download]] || || O23 ||Maximal Clique Problem || Guenther Charwat, Martin Kronegger, Johan Wittocx* || Optimization || Beyond NP || Graph || || [[https://www.mat.unical.it/aspcomp2013/MaximalClique|view]] || [[https://www.mat.unical.it/aspcomp2013/files/samples/maximal_clique-sample.zip|download]] || || O24 ||Labyrinth || Carmine Dodaro, Giovambattista Ianni, Martin Gebser* || Search || NP || Puzzle || ||[[https://www.mat.unical.it/aspcomp2013/Labyrinth|view]] || [[https://www.mat.unical.it/aspcomp2013/files/samples/labyrinth-sample.zip|download]] || || O25 ||Minimal Diagnosis || Marcello Balduccini, Martin Gebser* || Search || Beyond NP || Diagnosis || ||[[https://www.mat.unical.it/aspcomp2013/MinimalDiagnosis|view]] || [[https://www.mat.unical.it/aspcomp2013/files/samples/minimal_diagnosis-sample.zip|download]] || || O26 ||Hanoi Tower || Gayathri Namasivayam, Miroslaw Truszczynski, Shaden Smith, Alex Westlund || Search || NP || AI || ||[[https://www.mat.unical.it/aspcomp2013/HanoiTower|view]] || [[https://www.mat.unical.it/aspcomp2013/files/samples/hanoi_tower-sample.zip|download]] || || O27 ||Graph Colouring || Johannes Wallner, Marcello Balduccini*, Yuliya Lierler* || Search || NP || Graph || || [[https://www.mat.unical.it/aspcomp2013/GraphColouring|view]] || [[https://www.mat.unical.it/aspcomp2013/files/samples/graph_colouring-sample.zip|download]] || == Legend == Columns in the table below are to be read as following: * '''Nr'''. ID of the benchmark. The prefixes ''N'' resp. ''O'' denote a newly added resp. a 2011 benchmark. * '''Author(s)'''. Names of authors. A ''^*^'' denotes that they authored the respective package in previous years. * '''Type'''. One of ''Search'', ''Optimization'', ''Query''. See the problem [[BenchmarkProblems|classification]] page. * '''Final Problem Description'''. Problem specifications in their official form, with latest notes and updates. * '''Sample Instances'''. A link to sample instances of the given problem.