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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Annals of mathematics and artificial intelligence Jg. 83; H. 3-4; S. 277 - 295
Hauptverfasser:	Bliem, Bernhard, Woltran, Stefan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Cham Springer International Publishing 01.08.2018 Springer Springer Nature B.V
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!