On the Semantics of Defeasible Reasoning for Description Logic Ontologies

2014 ◽  
pp. 51-63
Author(s):  
Viet-Hoai To ◽  
Bac Le ◽  
Mitsuru Ikeda
Keyword(s):  
Description Logic ◽  
Defeasible Reasoning

scholarly journals An ASP approach for reasoning in a concept-aware multipreferential lightweight DL

2020 ◽  
Vol 20 (5) ◽  
pp. 751-766 ◽  
Author(s):  
Laura Giordano ◽  
Daniele Theseider Dupré
Keyword(s):  
Description Logic ◽  
Description Logics ◽  
Answer Set Programming ◽  
Defeasible Reasoning ◽  
Preferential Semantics ◽  
Answer Set ◽  
Qualitative Preferences

AbstractIn this paper we develop a concept aware multi-preferential semantics for dealing with typicality in description logics, where preferences are associated with concepts, starting from a collection of ranked TBoxes containing defeasible concept inclusions. Preferences are combined to define a preferential interpretation in which defeasible inclusions can be evaluated. The construction of the concept-aware multipreference semantics is related to Brewka’s framework for qualitative preferences. We exploit Answer Set Programming (in particular, asprin) to achieve defeasible reasoning under the multipreference approach for the lightweight description logic ξ$\mathcal L_ \bot ^ + $.

Deciding Query Entailment for Fuzzy Description Logic Knowledge Bases：The f-SH Family

2012 ◽  
Vol 35 (4) ◽  
pp. 767-785
Author(s):  
Jing-Wei CHENG ◽  
Zong-Min MA ◽  
Li YAN ◽  
Fu ZHANG
Keyword(s):  
Description Logic ◽  
Fuzzy Description

Semantics of OWL-S process model based on temporal description logic

2013 ◽  
Vol 33 (1) ◽  
pp. 266-269 ◽  
Author(s):  
Ming LI ◽  
Shiyi LIU ◽  
Fuzhong NIAN
Keyword(s):  
Process Model ◽  
Description Logic ◽  
Model Based

Syndication on the Web Using a Description Logic Approach

2008 ◽  
Author(s):  
Christian Halaschek-Wiener ◽  
Vladimir Kolovski
Keyword(s):  
Description Logic ◽  
Logic Approach ◽  
The Web

An Improved Set-based Reasoner for the Description Logic 𝒟ℒD4,׆

2021 ◽  
Vol 178 (4) ◽  
pp. 315-346
Author(s):  
Domenico Cantone ◽  
Marianna Nicolosi-Asmundo ◽  
Daniele Francesco Santamaria
Keyword(s):  
Semantic Web ◽  
Set Theory ◽  
Description Logic ◽  
Knowledge Bases ◽  
Query Answering ◽  
Conjunctive Query ◽  
Classification Problems ◽  
Previous Version ◽  
Decidable Fragment ◽  
Stratified Set

We present a KE-tableau-based implementation of a reasoner for a decidable fragment of (stratified) set theory expressing the description logic 𝒟ℒ〈4LQSR,×〉(D) (𝒟ℒD4,×, for short). Our application solves the main TBox and ABox reasoning problems for 𝒟ℒD4,×. In particular, it solves the consistency and the classification problems for 𝒟ℒD4,×-knowledge bases represented in set-theoretic terms, and a generalization of the Conjunctive Query Answering problem in which conjunctive queries with variables of three sorts are admitted. The reasoner, which extends and improves a previous version, is implemented in C++. It supports 𝒟ℒD4,×-knowledge bases serialized in the OWL/XML format and it admits also rules expressed in SWRL (Semantic Web Rule Language).

Sign in / Sign up

Export Citation Format

Share Document