bus_scheduling.lp: Scheduling the number of buses for 6 days (from Taha "Operations Research").building_blocks2.lp4: Building Blocks puzzle (Dell Logic Puzzles), faster version.building_blocks2.lp: Building Blocks puzzle (Dell Logic Puzzles), faster version.building_blocks.lp: Building Blocks puzzle (Dell Logic Puzzles).averbach_1.4.lp: Seating problem, example 1.4 in Averbach & Chein "Problem Solving Through Recreational Mathematics".assignment.lp4: Assignment problem (from Winston "Operations Research").assignment.lp: Assignment problem (from Winston "Operations Research").arch_friends.lp4: Arch friends puzzle (Dells Logic Puzzles).arch_friends.lp: Arch friends puzzle (Dells Logic Puzzles).alldifferent_except_0.lp4: Alldifferent except 0.alldifferent_except_0.lp: Alldifferent except 0.all_interval.lp4: All interval problem (CSPLib problem #7).all_interval.lp: All interval problem (CSPLib problem #7).a_round_of_golf.lp4: A round of gold (Dell Logic Puzzles).a_round_of_golf.lp: A round of gold (Dell Logic Puzzles).
3_jugs.lp4: 3 jugs problem (as a graph problem).3_jugs.lp: 3 jugs problem (as a graph problem).The encodings ported to Gringo 4 has extension. See Common constraint programming problems for a list of different implementations.Īll are written in Gringo/Clingo/clasp, but should be quite easy to convert to other ASP systems, e.g. Almost all of of them have also been done in some Constraint Programming system, for example MiniZinc. Also see Potasssco Labs, and Potassco Wiki Potassco Answer Set Solving Collection, includes clasp, Gringo, Clingo, and other tools.Teaching Answer Set Programming (Potassco teaching material for Answer Set Programming).Collection on Answer Set Programming (ASP) and more (Torsten Schaub).It's quite theoretical but also contains a lot of encoding examples. The book Knowledge Representation, Reasoning and Declarative Problem Solving by Chitta Baral (2003, Cambridge University Press, ISBN: 9780521147750).Thomas Eiter, Giovambattista Ianni, Thomas Krennwallner: Answer Set Programming: A Primer (PDF).Texas Action Group (TAG, TAG Members).Third Answer Set Programming Competition - 2011.The Second Answer Set Programming Competition.The First Answer Set Programming System Competition.I have blogged about this in A first look at Answer Set Programming. The computational process employed in the design of many answer set solvers is an enhancement of the DPLL algorithm and, in principle, it always terminates (unlike Prolog query evaluation, which may lead to an infinite loop). In ASP, search problems are reduced to computing stable models, and answer set solvers - programs for generating stable models are used to perform search. It is based on the stable model (answer set) semantics of logic programming. My Answer Set Programming Page My Answer Set Programming PageĪnswer set programming (ASP) is a form of declarative programming oriented towards difficult (primarily NP-hard) search problems.
0 kommentar(er)
