2026-07-22T09:18:39Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6732 2024-03-06T10:29:55Z ddc:004 open_access

SMT-Based Constraint Answer Set Solver EZSMT (System Description) Susman, Benjamin Lierler, Yuliya constraint answer set programming constraint satisfaction processing satisfiability modulo theories Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. Recently, the formal link between this research area and satisfiability modulo theories (or SMT) was established. This link allows the cross-fertilization between traditionally different solving technologies. The paper presents the system ezsmt, one of the first SMT-based solvers for constraint answer set programming. It also presents the comparative analysis of the performance of ezsmt in relation to its peers including solvers EZCSP, CLINGCON, and MINGO. Experimental results demonstrate that SMT is a viable technology for constraint answer set programming. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Benjamin Susman and Yuliya Lierler 2016 Is Part Of OASIcs, Volume 52, Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ICLP.2016.1 urn:nbn:de:0030-drops-67321 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2016.1 eng https://creativecommons.org/licenses/by/3.0/legalcode