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

Full description

Bibliographic Details

Published in:	Annals of mathematics and artificial intelligence Vol. 83; no. 3-4; pp. 277 - 295
Main Authors:	Bliem, Bernhard, Woltran, Stefan
Format:	Journal Article
Language:	English
Published:	Cham Springer International Publishing 01.08.2018 Springer Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!