Integrating Ontology Languages and Answer Set Programming

We integrate ontology languages and logic programming (LP) by extending disjunctive logic programs (DLPs) and their semantics in order to support inverses and an infinite universe, without introducing function symbols. We show that this extension is still decidable, and can be used to simulate, on the one hand, answer set programming with a finite universe, and on the other hand, several expressive description logics (DLs), which can be seen as ontology languages. The integration leads to a “best of both worlds”: from the LP side it inherits a flexible and intuitive representation of knowledge, whereas the DLs side provides the possibility to represent infinite knowledge.