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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.