A hybrid reasoning system for terminologies and first-order clauses in knowledge bases
New Generation Computing
Combining answer set programming with description logics for the Semantic Web
Artificial Intelligence
Extending Carin to the Description Logics of the $\mathcal{SH}$ Family
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Answer set programming for the semantic web
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Dually structured concepts in the semantic web: answer set programming approach
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
An argumentation framework for non-monotonic reasoning in description logic
RSKT'12 Proceedings of the 7th international conference on Rough Sets and Knowledge Technology
| Hi-index | 0.00 |
We integrate ontology languages and logic programming(LP) by extending disjunctive logic programs (DLPs) andtheir semantics in order to support inverses and an infiniteuniverse, without introducing function symbols. We showthat this extension is still decidable, and can be used tosimulate, on the one hand, answer set programming witha finite universe, and on the other hand, several expressivedescription 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 representationof knowledge, whereas the DLs side provides thepossibility to represent infinite knowledge.