A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web
We present a novel combination of disjunctive programs under the answer set semantics with description logics for the Semantic Web. The combination is based on a well-balanced interface between disjunctive programs and description logics, which guarantees the decidability of the resulting formalism...
| Main Author: | |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2010
|
| _version_ | 1797060427664850944 |
|---|---|
| author | Lukasiewicz, T |
| author_facet | Lukasiewicz, T |
| author_sort | Lukasiewicz, T |
| collection | OXFORD |
| description | We present a novel combination of disjunctive programs under the answer set semantics with description logics for the Semantic Web. The combination is based on a well-balanced interface between disjunctive 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 define the well-founded semantics for the normal case, where normal programs are combined with tractable description logics, and we explore its semantic and computational properties. In particular, we show that the well-founded semantics approximates the answer set semantics. We also describe algorithms for the problems of consistency checking and literal entailment under the well-founded semantics, and we give a precise picture of their computational complexity. As a crucial property, in the normal case, consistency checking and literal entailment under the well-founded semantics are both tractable in the data complexity, and even first-order rewritable (and thus can be done in LogSpace in the data complexity) in a special case that is especially useful for representing mappings between ontologies. © 2010 IEEE. |
| first_indexed | 2024-03-06T20:16:58Z |
| format | Journal article |
| id | oxford-uuid:2c71be74-d8f1-4940-863c-45452da91248 |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-06T20:16:58Z |
| publishDate | 2010 |
| record_format | dspace |
| spelling | oxford-uuid:2c71be74-d8f1-4940-863c-45452da912482022-03-26T12:37:15ZA Novel Combination of Answer Set Programming with Description Logics for the Semantic WebJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:2c71be74-d8f1-4940-863c-45452da91248EnglishSymplectic Elements at Oxford2010Lukasiewicz, TWe present a novel combination of disjunctive programs under the answer set semantics with description logics for the Semantic Web. The combination is based on a well-balanced interface between disjunctive 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 define the well-founded semantics for the normal case, where normal programs are combined with tractable description logics, and we explore its semantic and computational properties. In particular, we show that the well-founded semantics approximates the answer set semantics. We also describe algorithms for the problems of consistency checking and literal entailment under the well-founded semantics, and we give a precise picture of their computational complexity. As a crucial property, in the normal case, consistency checking and literal entailment under the well-founded semantics are both tractable in the data complexity, and even first-order rewritable (and thus can be done in LogSpace in the data complexity) in a special case that is especially useful for representing mappings between ontologies. © 2010 IEEE. |
| spellingShingle | Lukasiewicz, T A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web |
| title | A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web |
| title_full | A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web |
| title_fullStr | A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web |
| title_full_unstemmed | A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web |
| title_short | A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web |
| title_sort | novel combination of answer set programming with description logics for the semantic web |
| work_keys_str_mv | AT lukasiewiczt anovelcombinationofanswersetprogrammingwithdescriptionlogicsforthesemanticweb AT lukasiewiczt novelcombinationofanswersetprogrammingwithdescriptionlogicsforthesemanticweb |