Complexity results for answer set programming with bounded predicate arities and implications

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]

Authors

Thomas Eiter

This author has not been identified. Look up 'Thomas Eiter' in Google

Wolfgang Faber

This author has not been identified. Look up 'Wolfgang Faber' in Google

Michael Fink

This author has not been identified. Look up 'Michael Fink' in Google

Stefan Woltran

This author has not been identified. Look up 'Stefan Woltran' in Google