EZSMT 3.0 is an SMT-based Constraint Answer Set Programming (CASP) framework designed to enhance the translational approach to CASP solving. It is built upon the EZSMT+ system and features several notable enhancements:
-
More Expressive Input Language: EZSMT 3.0 introduces a more expressive input language that better describes complex combinatorial search problems.
-
Optimization Support: The framework supports optimization through weak constraints, enhancing its solving capabilities.
-
Integration of New Constraint Types: It provides a foundation for the streamlined integration of new constraint types, expanding the system's flexibility.
Instead of implementing custom search procedures, EZSMT 3.0 leverages state-of-the-art SMT solvers such as CVC5, YICES, and Z3 for reasoning. The paper presents benchmarking results comparing EZSMT 3.0 with its CASP peers like CLINGCON, CLINGO[DL], and CLINGO[LP], showcasing its ability to handle mixed-domain constraints involving both integers and reals. This system offers a robust platform for future extensions and theoretical exploration within the CASP domain.
Blogger's Review: The release of EZSMT 3.0 marks a significant advancement in the field of Constraint Answer Set Programming. Its flexibility and powerful solving capabilities provide new insights for addressing complex problems, making it a worthy subject for developers and researchers to explore and apply. The integration with modern SMT solvers showcases the immense potential of technological convergence.