CMODELS(DIFF) is an answer set programming solver which takes an answer set program processed by Lparse or Gringo and produces an SMT-LIB compliant program. The resultant program is solved using a Satisfiability Modulo Theories solver such as CVC4, Z3, Yices.
CMODELS(DIFF) version 1.0.0 is available for download here (under GPLv3):
Theoretical and practical groundings for this work can be found in:
- Da Shen and Yuliya Lierler. SMT-based Answer Set Solver CMODELS(DIFF) (System Description). The 34th International Conference on Logic Programming (ICLP), 2018; Benchmarks discussed in this paper are posted here.