#acl EditorsGroup:read,write,delete,revert,admin All:read = INCA = == Team == * Christian Drescher (NICTA and the University of New South Wales) * Valentin Mayer-Eichberger (NICTA and the University of New South Wales) == Description == INCA implements Constraint Answer Set Programming (CASP) via Lazy Nogood Generation (LNG) and a selection of translation techniques. It integrates GRINGO (3.0.92) for grounding CASP specifications, embeds CLASP (1.3.10) as its core search engine, and features a small collection of constraint propagators with their standard implementations that were enhanced with LNG capacities. == System Settings == The default settings of INCA is the following: {{{--var-encoding=force-bound --lazy var --lazy alldifferent --lazy linear --alldifferent-dc=no --linear-bc=no}}} It includes the bound representation of variables, LNG of constraint programming extensions using rather cheap propagation of global constraints (e.g., arc consistency propagator for all-different), and the default settings of the underlying systems. The following table provides parameters that overrule the default settings on a per benchmark domain basis. ||'''Nr'''||'''Benchmark Domain''' ||'''System''' ||'''Parameters''' || ||N01 || Permutation Pattern Matching ||INCA ||{{{--lazier --alldifferent-dc --linear-bc}}} || ||N02 || Valves Location Problem ||INCA ||{{{--opt-heu}}} || ||N04 || Connected Maximum-density Still Life ||INCA ||{{{--opt-heu}}} || ||N05 || Graceful Graphs ||INCA ||{{{--lazier --alldifferent-dc --heuristic=vsids}}} || ||N06 || Bottle Filling Problem ||INCA ||{{{--heuristic=vsids}}} || ||N07 || Nomystery ||INCA ||{{{--heuristic=vsids --reduce-on-restart --restarts=100,1.0}}} || ||N08 || Sokoban ||INCA ||{{{--heuristic=vsids}}} || ||N09 || Ricochet Robots ||INCA ||{{{--heuristic=vsids --restarts=100,1.0 --save-progress}}} || ||O10 || Crossing Minimization ||INCA ||{{{--linear-bc --opt-heu --heuristic=vsids --restart-on-model --reset-restart --deletion=3,75}}} || ||N11 || Reachability ||DINGO+CLASPD || || ||N12 || Strategic Companies ||GRINGO+CLASPD||{{{--approx-usc=no --del=3,1.1,100 --forward-check=1.0}}} || ||O13 || Solitaire ||INCA ||{{{--heuristic=vsids --restarts=256 --save-progress}}} || ||O14 || Weighted-Sequence Problem ||INCA ||{{{--alldifferent-dc}}} || ||O15 || Stable Marriage ||INCA ||{{{--var-encoding=value --heuristic=vsids --restarts=256 --save-progress}}} || ||O16 || Incremental Scheduling ||INCA ||{{{--linear-bc --heuristic=vsids}}} || == References == * Drescher C. and Walsh T. ''Answer Set Solving with Lazy Nogood Generation''. ICLP (Technical Communications) 2012: 188-200 * Drescher C. and Walsh T. ''A Translational Approach to Constraint Answer Set Solving''. Theory and Practice of Logic Programming, 10:4-6, 2010