文章基本信息

标题：SMT-Based Constraint Answer Set Solver EZSMT (System Description)
本地全文：下载
作者：Benjamin Susman ; Yuliya Lierler
期刊名称：OASIcs : OpenAccess Series in Informatics
电子版ISSN：2190-6807
出版年度：2016
卷号：52
页码：1-15
DOI：10.4230/OASIcs.ICLP.2016.1
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：constraint answer set programming; constraint satisfaction processing; satisfiability modulo theories