welcome: please sign in
location: Diff for "OfficialProblemSuite"
Differences between revisions 64 and 65
Revision 64 as of 2013-02-24 21:41:15
Size: 17001
Comment:
Revision 65 as of 2013-02-25 10:04:25
Size: 17189
Editor: e214-001
Comment:
Deletions are marked like this. Additions are marked like this.
Line 14: Line 14:
 *Feb. 25th, 2013:
  * Updated Valves Location Problem and Abstract Dialectical Frameworks Well-founded Model Problem checkers to additionally output the costs of the provided solution.

Official Problem Suite

Changelog

  • Feb. 25th, 2013:
    • Updated Valves Location Problem and Abstract Dialectical Frameworks Well-founded Model Problem checkers to additionally output the costs of the provided solution.
  • Feb. 22nd, 2013:
    • Updated Knight Tour with Holes description
  • Feb. 18th, 2013:
    • Updated Bottle Filling sample instances
  • Feb. 14th, 2013:
    • Updated ASP-Core-2 encoding for Valves Location

  • Feb. 13th, 2013:
    • Updated ASP-Core-2 encoding for Ricochet Robot

    • Removed Rotating workforce scheduling from the problem list.

  • Feb. 11th, 2013:
    • Marked with * codes of 2011's problems with slight different specification.

    • Updated Crossing Minimization and Maximal Clique Problem checkers to additionally output the costs of the provided solution.
    • A fix in the Valves Location encoding.

  • Feb. 10th, 2013:
    • Fix, update and clarify specs for Rotating Workforce Scheduling.
  • Feb. 9th, 2013:
    • Specified that trucks can carry more than one package in Nomystery.
    • Added sample instances for Reachability.
    • Update specs for Strategic Companies.
    • Fix specs for Reachability.

Problem List - Model & Solve and System Track


Nr

Name

Author(s)

Type

Complexity

Domain

Problem Description

Sample Instances

Checker

ASP-Core-2 encoding

N01

Permutation Pattern Matching

Martin Lackner, Andreas Pfandler

Search

NP

Combinatorial

view

download

download

Permutation Pattern Matching

N02

Valves Location Problem

Andrea Peano

Optimization

Beyond NP

Combinatorial

view

download

download

Valves Location Problem

N04

Connected Maximum-density Still Life

Christian Drescher

Optimization

Beyond NP

AI

view

download

download

Connected Maximum-density Still Life

N05

Graceful Graphs

Christian Drescher

Search

NP

Graph

view

download

download

Graceful Graphs

N06

Bottle Filling Problem

Wolfgang Faber

Search

Combinatorial

view

download

download

Bottle Filling Problem

N07

Nomystery

Giovambattista Ianni, Carlos Linares López*, Hootan Nakhost*

Search

Planning

view

download

download

Nomystery

N08

Sokoban

Giovambattista Ianni, Wolfgang Faber*, Carlos Linares López*

Search

Planning

view

download

download

Sokoban

N09

Ricochet Robots

Julius Höfler, Martin Gebser, Philipp Obermeier, Roland Kaminski, Torsten Schaub

Search

Puzzle

view

download

download

Ricochet Robot

O10

Crossing Minimization

Carmine Dodaro, Graeme Gange*, Peter Stuckey*

Optimization

Beyond NP

Graph

view

download

download

Crossing Minimization

N11*

Reachability

Carmine Dodaro, Giorgio Terracina*

Query

P

Graph

view

download

download

Reachability

N12*

Strategic Companies

Mario Alviano, Marco Maratea*, Francesco Ricca*

Query

Beyond NP

AI

view

download

download

Strategic Companies

O13

Solitaire

Marcello Balduccini, Yuliya Lierler*

Search

NP

Puzzle

view

download

download

Solitaire

O14

Weighted-Sequence Problem

Marcello Balduccini, Yuliya Lierlier, Shaden Smith

Search

NP

Database

view

download

download

Weighted-Sequence Problem

O15

Stable Marriage

Mario Alviano, Carmine Dodaro, Francesco Ricca

Search

P

Graph

view

download

download

Stable Marriage

O16

Incremental Scheduling

Marcello Balduccini, Yuliya Lierler*

Search

NP

Scheduling

view

download

download

Incremental Scheduling

Problem List - System Track only


Nr

Name

Author(s)

Type

Complexity

Domain

ASP-Core-2 Encoding

Problem Description

Sample Instances

Checker

ASP-Core-2 encoding

N17

Qualitative Spatial Reasoning

Jason Jingshi Li

Search

NP

Formal logic

view

download

Qualitative Spatial Reasoning

N18

Chemical Classification

Despoina Magka

Search

P

Natural Sciences

view

download

download

Chemical Classification (60+ MB)

N19

Abstract Dialectical Frameworks Well-founded Model

Stefan Ellmauthaler, Johannes Wallner

Optimization

Formal logic

view

download

download

Abstract Dialectical Frameworks Well-founded Model

N20

Visit-all

Giovambattista Ianni,Nir Lipovetzky*, Carlos Linares López*

Search

Planning

view

download

download

Visit-all

N21

Complex Optimization of Answer Sets

Martin Gebser, Roland Kaminski, Torsten Schaub

Search

Beyond NP

Synthetic

view

download

download

Complex Optimization of Answer Sets

N22*

Knight Tour with Holes

Francesco Calimeri, Neng-Fa Zhou*

Search

NP

Puzzle

view

download

download

Knight Tour with Holes

O23

Maximal Clique Problem

Guenther Charwat, Martin Kronegger, Johan Wittocx*

Optimization

Beyond NP

Graph

view

download

download

Maximal Clique Problem

O24

Labyrinth

Carmine Dodaro, Giovambattista Ianni, Martin Gebser*

Search

NP

Puzzle

view

download

download

Labyrinth

O25

Minimal Diagnosis

Marcello Balduccini, Martin Gebser*

Search

Beyond NP

Diagnosis

view

download

download

Minimal Diagnosis

O26

Hanoi Tower

Gayathri Namasivayam, Miroslaw Truszczynski, Shaden Smith, Alex Westlund

Search

NP

AI

view

download

download

Hanoi Tower

O27

Graph Colouring

Johannes Wallner, Marcello Balduccini*, Yuliya Lierler*

Search

NP

Graph

view

download

download

Graph Colouring

Legenda

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. New problems with a * denote an old problem with changes in its specification.

  • 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 classification page.

  • Complexity. One of P, NP or Beyond-NP. To be read as the known complexity of the underlying decisional problem associated to the domain at hand. P: known to be solvable in polynomial time in the size of input. NP: known to be solvable

in non-deterministic polynomial time in the size of input. Beyond-NP: any other problem.

  • Domain. The domain type, e.g. graph, scheduling, planning etc.

  • Problem Description. Problem specifications in their official form, with latest notes and updates.

  • Sample Instances. A link to sample instances for the given problem.

  • Checker. A checker script for validating solutions. See here for the checker I/O specifications.

  • ASP-Core-2 encoding. The encoding which will be used in the System Track. Recall that the Model & Solve track has no fixed encoding, no fixed input language instead.

Instance set

  • The .zip file containing the sha256sums of all the instance family from which instances will be selected randomly is available https://www.mat.unical.it/aspcomp2013/files/hashesASPCOMP2013.zip. The sha256sum of the file itself is this. Note, the archive is password protected, credentials to be disclosed after the competition.

  • How we will select instances is specified here.

ASP Competition 2013: OfficialProblemSuite (last edited 2020-10-05 10:54:33 by FrancescoCalimeri)