On relation between constraint answer set programming and satisfiability modulo theories
Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. It is often informally related to the field of satisfiability modulo theories. Yet, the exact formal link is obscured as the terminology and concepts used in these t...
Saved in:
| Published in: | Theory and practice of logic programming Vol. 17; no. 4; pp. 559 - 590 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Cambridge, UK
Cambridge University Press
01.07.2017
|
| Subjects: | |
| ISSN: | 1471-0684, 1475-3081 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!