clasp

Team

• Benjamin Kaufmann (University of Potsdam)
• Torsten Schaub (University of Potsdam)
• Marius Schneider (University of Potsdam)
• Martin Gebser (University of Potsdam)
• Roland Kaminski (University of Potsdam)

Description

clasp is an answer set solver for (extended) normal logic programs. It combines the high-level modeling capacities of ASP with state-of-the-art techniques from the area of Boolean constraint solving.

System Settings

• Version: clasp-2.1.2
• Grounder: gringo-3.0.5
• Encodings: gringo-3
• Num Threads: 1
• Mode: Sequential
• Options: --opt-heu=2 --restart-on-model --backprop --save-p=102
  • --del-init-r=300,24000 --deletion=2,50,6 --del-cfl=+,2000,500 --del-glue=3,0 --config=jumpy --sat-prepro=20,50,80,50,1,2000000 --counter-restarts=7 --counter-bump=1023

References

• Participant URL.

• Reference URL

• M. Gebser, B. Kaufmann, A. Neumann, and T. Schaub. Conflict-driven answer set solving. In Proceedings of IJCAI’07, pages 386–392. AAAI Press/MIT Press, 2007.