Thomas Eiter, Wolfgang Faber, Michael Fink, Stefan Woltran. Complexity results for answer set programming with bounded predicate arities and implications. Annals of Mathematics and Artificial Intelligence, 51(2-4):123-165, 2007. [doi]
@article{EiterFFW07,
title = {Complexity results for answer set programming with bounded predicate arities and implications},
author = {Thomas Eiter and Wolfgang Faber and Michael Fink and Stefan Woltran},
year = {2007},
doi = {10.1007/s10472-008-9086-5},
url = {http://dx.doi.org/10.1007/s10472-008-9086-5},
tags = {programming},
researchr = {https://researchr.org/publication/EiterFFW07},
cites = {0},
citedby = {0},
journal = {Annals of Mathematics and Artificial Intelligence},
volume = {51},
number = {2-4},
pages = {123-165},
}