A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web
From semanticweb.org
A paper written by Thomas Lukasiewicz. It was presented at the ESWC2007. It is about Reasoning on the Semantic Web, Logics for the Semantic Web and Semantic Web Rules and Query Languages
| The paper is available online at |
|---|
[edit] Abstract
We present a novel combination of disjunctive logic programs under the answer set semantics with description logics for the Semantic Web. The combination is based on a well-balanced interface between disjunctive logic programs and description logics, which guarantees the decidability of the resulting formalism without assuming syntactic restrictions. We show that the new formalism has very nice semantic properties. In particular, it faithfully extends both disjunctive programs and description logics. Furthermore, we describe algorithms for reasoning in the new formalism, and we give a precise picture of its computational complexity. We also provide a special case with polynomial data complexity.
This data has been imported from the ESWC2007 RDF
