Preferential default reasoning on the semantic web

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Abstract

The world of the Semantic Web includes many inconsistent knowledge bases, whose axioms are often unreliable and can therefore be naturally interpreted as defaults. In this article we introduce an extension of Sengupta et. al.'s semantics [12] with a preference order on the defaults with respect to satisfaction. In particular, the semantics we propose is an improved version of Heymans et. al.'s semantics [8] for a defeasible ontology language. One crucial difference we adopt is that the preference relation between interpretations is not only defined with respect to the same individuals, but any. We provide an algorithm to translate the entailment problem with respect to ordered default knowledge bases to the one for classical knowledge bases, and show its soundness and completeness. As a practical application scenario, we test our algorithm on various subsets of LOD Cloud, and report on our result.

Original languageEnglish
Title of host publicationDescription Logics DL 2018
Subtitle of host publicationProceedings of the 31st International Workshop on Description Logics co-located with 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018) Tempe, Arizona, US, October 27thto 29th, 2018
EditorsMagdalena Ortiz, Thomas Schneider
Pages1-12
Number of pages12
Publication statusPublished - 2018
Event31st International Workshop on Description Logics, DL 2018 - Tempe, United States
Duration: 27 Oct 201829 Oct 2018

Publication series

NameCEUR Workshop Proceedings
PublisherCEUR
Volume2211
ISSN (Print)1613-0073

Conference

Conference31st International Workshop on Description Logics, DL 2018
CountryUnited States
CityTempe
Period27/10/1829/10/18

Fingerprint

Semantic Web
Semantics
Set theory
Ontology

Keywords

  • Default Reasoning
  • Inconsistency
  • LOD Laundromat

Cite this

Kiesel, R., Acar, E., & Schlobach, S. (2018). Preferential default reasoning on the semantic web. In M. Ortiz, & T. Schneider (Eds.), Description Logics DL 2018: Proceedings of the 31st International Workshop on Description Logics co-located with 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018) Tempe, Arizona, US, October 27thto 29th, 2018 (pp. 1-12). (CEUR Workshop Proceedings; Vol. 2211).
Kiesel, Rafael ; Acar, Erman ; Schlobach, Stefan. / Preferential default reasoning on the semantic web. Description Logics DL 2018: Proceedings of the 31st International Workshop on Description Logics co-located with 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018) Tempe, Arizona, US, October 27thto 29th, 2018. editor / Magdalena Ortiz ; Thomas Schneider. 2018. pp. 1-12 (CEUR Workshop Proceedings).
@inproceedings{ab495dce03a24b03837c00dead182219,
title = "Preferential default reasoning on the semantic web",
abstract = "The world of the Semantic Web includes many inconsistent knowledge bases, whose axioms are often unreliable and can therefore be naturally interpreted as defaults. In this article we introduce an extension of Sengupta et. al.'s semantics [12] with a preference order on the defaults with respect to satisfaction. In particular, the semantics we propose is an improved version of Heymans et. al.'s semantics [8] for a defeasible ontology language. One crucial difference we adopt is that the preference relation between interpretations is not only defined with respect to the same individuals, but any. We provide an algorithm to translate the entailment problem with respect to ordered default knowledge bases to the one for classical knowledge bases, and show its soundness and completeness. As a practical application scenario, we test our algorithm on various subsets of LOD Cloud, and report on our result.",
keywords = "Default Reasoning, Inconsistency, LOD Laundromat",
author = "Rafael Kiesel and Erman Acar and Stefan Schlobach",
year = "2018",
language = "English",
series = "CEUR Workshop Proceedings",
publisher = "CEUR",
pages = "1--12",
editor = "Magdalena Ortiz and Thomas Schneider",
booktitle = "Description Logics DL 2018",

}

Kiesel, R, Acar, E & Schlobach, S 2018, Preferential default reasoning on the semantic web. in M Ortiz & T Schneider (eds), Description Logics DL 2018: Proceedings of the 31st International Workshop on Description Logics co-located with 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018) Tempe, Arizona, US, October 27thto 29th, 2018. CEUR Workshop Proceedings, vol. 2211, pp. 1-12, 31st International Workshop on Description Logics, DL 2018, Tempe, United States, 27/10/18.

Preferential default reasoning on the semantic web. / Kiesel, Rafael; Acar, Erman; Schlobach, Stefan.

Description Logics DL 2018: Proceedings of the 31st International Workshop on Description Logics co-located with 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018) Tempe, Arizona, US, October 27thto 29th, 2018. ed. / Magdalena Ortiz; Thomas Schneider. 2018. p. 1-12 (CEUR Workshop Proceedings; Vol. 2211).

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

TY - GEN

T1 - Preferential default reasoning on the semantic web

AU - Kiesel, Rafael

AU - Acar, Erman

AU - Schlobach, Stefan

PY - 2018

Y1 - 2018

N2 - The world of the Semantic Web includes many inconsistent knowledge bases, whose axioms are often unreliable and can therefore be naturally interpreted as defaults. In this article we introduce an extension of Sengupta et. al.'s semantics [12] with a preference order on the defaults with respect to satisfaction. In particular, the semantics we propose is an improved version of Heymans et. al.'s semantics [8] for a defeasible ontology language. One crucial difference we adopt is that the preference relation between interpretations is not only defined with respect to the same individuals, but any. We provide an algorithm to translate the entailment problem with respect to ordered default knowledge bases to the one for classical knowledge bases, and show its soundness and completeness. As a practical application scenario, we test our algorithm on various subsets of LOD Cloud, and report on our result.

AB - The world of the Semantic Web includes many inconsistent knowledge bases, whose axioms are often unreliable and can therefore be naturally interpreted as defaults. In this article we introduce an extension of Sengupta et. al.'s semantics [12] with a preference order on the defaults with respect to satisfaction. In particular, the semantics we propose is an improved version of Heymans et. al.'s semantics [8] for a defeasible ontology language. One crucial difference we adopt is that the preference relation between interpretations is not only defined with respect to the same individuals, but any. We provide an algorithm to translate the entailment problem with respect to ordered default knowledge bases to the one for classical knowledge bases, and show its soundness and completeness. As a practical application scenario, we test our algorithm on various subsets of LOD Cloud, and report on our result.

KW - Default Reasoning

KW - Inconsistency

KW - LOD Laundromat

UR - http://www.scopus.com/inward/record.url?scp=85056808691&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85056808691&partnerID=8YFLogxK

M3 - Conference contribution

T3 - CEUR Workshop Proceedings

SP - 1

EP - 12

BT - Description Logics DL 2018

A2 - Ortiz, Magdalena

A2 - Schneider, Thomas

ER -

Kiesel R, Acar E, Schlobach S. Preferential default reasoning on the semantic web. In Ortiz M, Schneider T, editors, Description Logics DL 2018: Proceedings of the 31st International Workshop on Description Logics co-located with 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018) Tempe, Arizona, US, October 27thto 29th, 2018. 2018. p. 1-12. (CEUR Workshop Proceedings).