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

Celý popis

Podrobná bibliografie

Vydáno v:	Theory and practice of logic programming Ročník 17; číslo 4; s. 559 - 590
Hlavní autoři:	LIERLER, YULIYA, SUSMAN, BENJAMIN
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Cambridge, UK Cambridge University Press 01.07.2017
Témata:	Arithmetic Fertilization Programming Regular Papers Solvers Terminology satisfiability modulo theories constraint satisfaction processing constraint answer set programming
ISSN:	1471-0684, 1475-3081
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!