Combining Answer Set Programming and Domain Heuristics for Solving Hard Industrial Problems

This website contains sources, binaries, and a more detailed version of the evaluation results discussed in our ICLP-16 submission "Combining Answer Set Programming and Domain Heuristics for Solving Hard Industrial Problems".

Source Code

All sources are published on GitHub:

• WASP with C++ heuristic implementations (branch development)
• WASP with python support (branch plugins)
• CCP heuristic in python (branch master)

Resources

The following resources are available:

• Encodings for PUP and CCP
• Instances for PUP and CCP
• Binaries (linux) of the heurstic solver
• Binaries (windows) of the heuristic solver

Usage

Make sure that the gringo 4.x binaries are available on the PATH. Use the commands gringo [encoding] [instance] | ./hwasp --heuristic-pup=[heuristic] and gringo [encoding] [instance] | ./hwasp --heuristic-ccp=[heuristic] to execute a benchmark for PUP and CCP, respectively. To run the CCP heuristic in python (linux only), execute the command gringo [encoding] [instance] | ./hwasp_python --heuristic-interpreter=python --heuristic-scriptname=heuristic-ccp Note that [encoding] and [instance] are the files containing both the problem encoding and an instance of the problem, respectively. Furthermore, [heuristic] dertermines which heuristic shall be executed. See the table below for all posibile values.

Evaluation results

The complete results of our evaluation are located here (use the buttons on the bottom left hand corner to switch between the PUP and CCP results).