The following publications are possibly variants of this publication:
- Replacements in Non-Ground Answer-Set ProgrammingThomas Eiter, Michael Fink, Hans Tompits, Patrick Traxler, Stefan Woltran. kr 2006: 340-351
- An Implementation for Recognizing Rule Replacements in Non-ground Answer-Set ProgramsThomas Eiter, Patrick Traxler, Stefan Woltran. jelia 2006: 477-480 [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
- On Structural Analysis of Non-Ground Answer-Set ProgramsBenjamin Kiesl, Peter Schüller, Hans Tompits. ICLP 2015: [doi]
- Abstraction for non-ground answer set programsZeynep Gozen Saribatur, Thomas Eiter, Peter Schüller. ai, 300:103563, 2021. [doi]
- Abstraction for Non-ground Answer Set ProgramsZeynep Gozen Saribatur, Peter Schüller, Thomas Eiter. jelia 2019: 576-592 [doi]