The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics

Mario Alviano, Wolfgang Faber. The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics. In Pedro Cabalar, Tran Cao Son, editors, Logic Programming and Nonmonotonic Reasoning, 12th International Conference, LPNMR 2013, Corunna, Spain, September 15-19, 2013. Proceedings. Volume 8148 of Lecture Notes in Computer Science, pages 67-72, Springer, 2013. [doi]

Abstract

Abstract is missing.