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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theory and practice of logic programming Jg. 17; H. 4; S. 559 - 590
Hauptverfasser:	LIERLER, YULIYA, SUSMAN, BENJAMIN
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Cambridge, UK Cambridge University Press 01.07.2017
Schlagworte:	Arithmetic Fertilization Programming Regular Papers Solvers Terminology satisfiability modulo theories constraint satisfaction processing constraint answer set programming
ISSN:	1471-0684, 1475-3081
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!