Equivalence between answer-set programs under (partially) fixed input

Answer Set Programming has become an increasingly popular formalism for declarative problem solving. Among the huge body of theoretical results, investigations of different equivalence notions between logic programs play a fundamental role for understanding modularity and optimization. While strong...

Celý popis

Podrobná bibliografie

Vydáno v:	Annals of mathematics and artificial intelligence Ročník 83; číslo 3-4; s. 277 - 295
Hlavní autoři:	Bliem, Bernhard, Woltran, Stefan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Cham Springer International Publishing 01.08.2018 Springer Springer Nature B.V
Témata:	Artificial Intelligence Complex Systems Computer Science Context Declarative programming Equivalence Investigations Logic programs Mathematical programming Mathematics Modularity Problem solving Equivalence 68N17 Answer set programming
ISSN:	1012-2443, 1573-7470
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!