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.2018.11
URN: urn:nbn:de:0030-drops-98775
URL: https://drops.dagstuhl.de/opus/volltexte/2018/9877/
Shen, Da ; Lierler, Yuliya
SMT-Based Answer Set Solver CMODELS(DIFF) (System Description)
| pdf-format: |
|
Abstract
Many answer set solvers utilize Satisfiability solvers for search. Satisfiability Modulo Theory solvers extend Satisfiability solvers. This paper presents the CMODELS(DIFF) system that uses Satisfiability Modulo Theory solvers to find answer sets of a logic program. Its theoretical foundation is based on Niemala's characterization of answer sets of a logic program via so called level rankings. The comparative experimental analysis demonstrates that CMODELS(DIFF) is a viable answer set solver.
BibTeX - Entry
@InProceedings{shen_et_al:OASIcs:2018:9877,
author = {Da Shen and Yuliya Lierler},
title = {{SMT-Based Answer Set Solver CMODELS(DIFF) (System Description)}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {11:1--11:15},
series = {OpenAccess Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Alessandro Dal Palu' and Paul Tarau and Neda Saeedloei and Paul Fodor},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9877},
URN = {urn:nbn:de:0030-drops-98775},
doi = {10.4230/OASIcs.ICLP.2018.11},
annote = {Keywords: answer set programming, satisfiability modulo theories, constraint satisfaction processing}
}
| Keywords: | answer set programming, satisfiability modulo theories, constraint satisfaction processing | |
| Seminar: | Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018) | |
| Issue date: | 2018 | |
| Date of publication: | 19.11.2018 |
