The following publications are possibly variants of this publication:
- On the Complexity of Answer Set Programming with AggregatesWolfgang Faber, Nicola Leone. lpnmr 2007: 97-109 [doi]
- Semantical characterizations and complexity of equivalences in answer set programmingThomas Eiter, Michael Fink, Stefan Woltran. tocl, 8(3):17, 2007. [doi]
- Complexity results for answer set programming with bounded predicate arities and implicationsThomas Eiter, Wolfgang Faber, Michael Fink, Stefan Woltran. AMAI, 51(2-4):123-165, 2007. [doi]
- Complexity of Answer Set Checking and Bounded Predicate Arities for Non-ground Answer Set ProgrammingThomas Eiter, Wolfgang Faber, Michael Fink, Gerald Pfeifer, Stefan Woltran. asp 2003: [doi]
- Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground CaseThomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran. AAAI 2005: 695-700