License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ICLP.2016.1
URN: urn:nbn:de:0030-drops-67321
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6732/
Go to the corresponding OASIcs Volume Portal

Susman, Benjamin ; Lierler, Yuliya

SMT-Based Constraint Answer Set Solver EZSMT (System Description)

pdf-format:
OASIcs-ICLP-2016-1.pdf (0.5 MB)

Abstract

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.

BibTeX - Entry

@InProceedings{susman_et_al:OASIcs:2016:6732,
  author =	{Benjamin Susman and Yuliya Lierler},
  title =	{{SMT-Based Constraint Answer Set Solver EZSMT (System Description)}},
  booktitle =	{Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)},
  pages =	{1:1--1:15},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-007-1},
  ISSN =	{2190-6807},
  year =	{2016},
  volume =	{52},
  editor =	{Manuel Carro and Andy King and Neda Saeedloei and Marina De Vos},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6732},
  URN =		{urn:nbn:de:0030-drops-67321},
  doi =		{10.4230/OASIcs.ICLP.2016.1},
  annote =	{Keywords: constraint answer set programming, constraint satisfaction processing, satisfiability modulo theories}
}

Keywords: constraint answer set programming, constraint satisfaction processing, satisfiability modulo theories
Collection: Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)
Issue Date: 2016
Date of publication: 11.11.2016

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI