#acl EditorsGroup:read,write,delete,revert,admin All:read = Potassco = <> == Association == University of Potsdam, Germany == Description == [[http://potassco.sourceforge.net/|Potassco]], the "Potsdam Answer Set Solving Collection", bundles tools for Answer Set Programming developed at the University of Potsdam. It includes: * solver clasp (version 2.0.0-RC2) * solver claspD (version 1.1.1) * grounder Gringo (version 3.0.3) * grounder + (constraint) solver Clingcon (version 0.1.2) Sources (and binaries) as well as detailed descriptions of the systems are available at the [[http://potassco.sourceforge.net/|Potassco]] project page. == Participants == * Benjamin Andres * Christian Drescher * Martin Gebser * Torsten Grote * Roland Kaminski * Benjamin Kaufmann * Arne König * Yuliya Lierler * Oliver Matheis * Max Ostrowski * Orkunt Sabuncu * Torsten Schaub * Marius Schneider * Sven Thiele == System Settings == For problems solved with either ''clasp'' or ''claspD'', we ran ''Gringo''(default settings) for grounding, while ''Clingcon'' extends and embeds ''Gringo'' to perform grounding internally. The following table provides an overview of the systems (omitting ''Gringo'') and solver parameters we used: <
> ||#||<(>Problem Name||<(>Problem Type||<(>System||<(>Parameters|| ||01||Crossing Minimization||Optimization||clasp||--restart-on-m --sat-p=20,25,120 --opt-heu=2|| ||02||Reachability||P||clasp|| || ||03||Strategic Companies||Beyond NP||claspD||--approx-usc=no --del=3,1.1,100 --forward-check=1.0|| ||04||Company Controls||P||clasp|| || ||05||Company Controls Optimize||Optimization||clasp||--restart-on-m --opt-heu=2|| ||06||Grammar Based Information Extraction||P||clasp|| || ||07||Generalized Slitherlink||NP||clasp||--backprop --dinit=800,10000|| ||08||Fastfood Optimality Check||NP||clasp|| || ||09||Fastfood Optimization||Optimization||clasp||--restart-on-m --opt-heu=1 --sat-p=20,25,120|| ||10||Sokoban Decision||NP||clasp||--sat-p=20,25,120 --tr=dynamic --heu=VSIDS --dinit=800,10000|| ||11||Sokoban Optimization||Optimization||clasp||--solu --reset-restart --heu=VSIDS|| ||12||Knight Tour||NP||clasp||--restarts=256 --save-p --heu=VSIDS --dinit=800,10000|| ||13||Disjunctive Scheduling||NP||clingcon||--csp-num-as=1 --restarts=no|| ||14||Packing Problem||NP||clasp||--heu=VSIDS --sat-p=20,25,120 --dinit=800,10000 --restarts=256 --save-p|| ||15||Tomography||Optimization||clasp||--restart-on-model --dinit=1000,10000 --berk-once --reset-r --del=0.05,1.1,100 --dsched=5000,1.1 --otfs=1|| ||16||Maximal Clique||Optimization||clasp||--restart-on-model --reset-r|| ||17||Labyrinth||NP||clasp||--backprop --dinit=1000,10000 --dsched=20000,1.1 --sat-p=20,25,120|| ||18||Minimal Diagnosis||Beyond NP||claspD|| || ||20||Numberlink||NP||clasp||--backprop --dinit=1000,10000 --dsched=20000,1.1 --sat-p=20,25,120|| ||21||Reverse Folding||NP||clasp||--restarts=512 --sat-p=20,5,120,-1,0 --dinit=1500,5000 --dglue=2 --update-lbd --dsched=2048 --otfs=1|| ||22||Hanoi Tower||NP||clasp||--sat-p=20,25,120 --heu=VSIDS --dinit=800,10000|| ||23||Magic Square Sets||NP||clasp|| || ||25||Graph Colouring||NP||clasp||--sat-p=20,25,120 --tr=dynamic --initial-look=10 --restarts=no --dinit=800,10000|| ||26||Solitaire||NP||clasp||--restarts=256 --save-p --heu=VSIDS --dinit=800,10000|| ||27||Partner Units||NP||clasp||--sat-p=20,25,120 --heu=VSIDS --dinit=800,10000|| ||28||Weight-Assignment Tree||NP||clingcon||--csp-num-as=1|| ||30||Hydraulic Leaking||P||clasp|| || ||31||Hydraulic Planning||P||clasp|| || ||32||Stable Marriage||P||clasp||--restarts=256 --save-p --heu=VSIDS --dinit=800,10000|| ||33||Maze Generation||NP||clasp||--heu=VSIDS --del=3,1.1,1000 --restarts=100,1.5,20000 --local-r --dinit=800,10000|| ||34||Partner Units Polynomial||P||clasp||--sat-p=20,25,120 --heu=VSIDS --dinit=800,10000|| ||35||Incremental Scheduling||NP||clingcon||--csp-num-as=1 --restarts=no|| ||36||Tangram||NP||clasp|| || Note that option names are automatically expanded if unambiguos, e.g., "--heu" stands for option "--heuristic". Note also that we did not participate in problem 24 - Airport Pickup. {{{#!wiki comment [[http://www.mat.unical.it/aspcomp2011/files/participants/m&s-track-Potassco.zip|download]] }}}