SAT Tools — A Tool Collection for Boolean Satisfiability

This page collects software that have been developed for Boolean Satisfiability (SAT) purposes by the Computational Logic Group at the CS Department of Aalto SCI. Some binaries are available for download.

Index

• GG-STS: Solver for abstract argumentation
• MADAGASCAR: SAT-based techniques for AI planning
• SATGRND: Writing declarative first-order specifications for clauses (also called clause programs)
• SAT-to-SAT: Solver for the nested instances of the Boolean satisfiability problem

Contact

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