ASP Tools — A Tool Collection for Answer Set Programming

This page collects software that have been developed for Answer Set Programming (ASP) purposes by the Computational Logic Group at the CS Department of Aalto SCI. The software comprises of native ASP solvers, a number of translators enabling the use of different back-end solvers, and a variety of miscellaneous tools related with ASP. Some benchmark collections are available under tool-specific directories as well as a dedicated benchmark directory. Binaries are available for download. Some ASP encodings are published here.

Index

• CIRC2LP: Translating circumscription to disjunctive logic programming
• DINGO: Extending ASP with difference constraints
• GnT: A solver for disjunctive logic programs
• LP2ACYC: Implementing ASP via SAT modulo acyclicity
• LP2BV: Translating normal/smodels programs for SMT (bit vector) solvers
• LP2DIFF: Translating normal/smodels programs for SMT (difference logic) solvers
• LP2NORMAL: Translating smodels programs into normal programs
• LP2SAT: Translating normal/smodels programs for SAT solvers
• LPEQ: Verifying the equivalence of logic programs
• MINGO: Extending ASP with linear constraints over integers
• MINGOR: Extending ASP with linear constraints over reals
• Miscellaneous tools for ASP
• Modularity support for answer set programming
• SATEQ: Verifying the equivalence of sets of clauses
• SMODELS: A solver for normal logic programs extended by cardinality/weight constraints and Boolean optimization

Contact

For further inquiries about these tools, please contact Tomi Janhunen.