EZSMT

EZSMT is a constraint answer set programming solver which takes a program written in EZCSP and produces an SMT-LIB compliant program. The resultant program can be run on Satisfiability Modulo Theories solvers such as CVC4, Z3, and Yices. EZSMT used EZCSP, Gringo, and CMODELS to perform its transformation procedures.

README file is present within the download content. In copmairson to its earlier version, EZSMT version 2.0.0 is able to process non-tight programs, enumerate multiple solutions, process programs with linear and nonlinear constraints over mixed real and integer variables.

Theoretical and practical groundings for EZSMT version 2.0.0 can be found in:

Our Campus. Otherwise Known as Omaha.

The University of Nebraska does not discriminate based on race, color, ethnicity, national origin, sex, pregnancy, sexual orientation, gender identity, religion, disability, age, genetic information, veteran status, marital status, and/or political affiliation in its programs, activities, or employment. Learn more about Equity, Access and Diversity.