The following publications are possibly variants of this publication:
- 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]
- Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set ProgrammingThomas Eiter, Wolfgang Faber, Michael Fink, Gerald Pfeifer, Stefan Woltran. kr 2004: 377-387
- 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
- Answer-Set Programming with Bounded TreewidthMichael Jakl, Reinhard Pichler, Stefan Woltran. IJCAI 2009: 816-822 [doi]
- 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]