Conjunctive Query Answering in Finitely-Valued Fuzzy Description Logics

被引：0

作者：

Mailis, Theofilos ^{[1
]}

Penaloza, Rafael ^{[1
]}

Turhan, Anni-Yasmin ^{[1
]}

机构：

[1] Tech Univ Dresden, Chair Automata Theory Theoret Comp Sci, Dresden, Germany

来源：

WEB REASONING AND RULE SYSTEMS, RR 2014 | 2014年 / 8741卷

关键词：

ENTAILMENT;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Fuzzy Description Logics (DLs) generalize crisp ones by providing membership degree semantics for concepts and roles. A popular technique for reasoning in fuzzy DL ontologies is by providing a reduction to crisp DLs and then employ reasoning in the crisp DL. In this paper we adopt this approach to solve conjunctive query (CQ) answering problems for fuzzy DLs. We give reductions for Godel, and Lukasiewicz variants of fuzzy SROIQ and two kinds of fuzzy CQs. The correctness of the proposed reduction is proved and its complexity is studied for different fuzzy variants of SROIQ.

引用

页码：124 / 139

页数：16

共 27 条

[1]

[Anonymous], P 5 INT WORKSH OWL E

[2]

[Anonymous], 2006, EVEN MORE IRRESISTIB

[3]

[Anonymous], 2013, FDN FUZZY LOGIC SEMA

[4]

[Anonymous], 2006, P 11 INT C INF PROC

[5]

[Anonymous], P ESWC WORKSH ADV RE

[6]

Baader F., 2014, J PHILOS LOGIC

[7]

Bobillo F., 2013, LNCS, V7123, P99

[8] Reasoning with the finitely many-valued Lukasiewicz fuzzy Description Logic SROIQ [J].

Bobillo, Fernando ;

Straccia, Umberto .

INFORMATION SCIENCES, 2011, 181 (04) :758-778

[9] Fuzzy description logics under Godel semantics [J].

Bobillo, Fernando ;

Delgado, Miguel ;

Gomez-Romero, Juan ;

Straccia, Umberto .

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2009, 50 (03) :494-514

[10]

Bobillo F, 2008, LECT NOTES ARTIF INT, V5327, P189

← 1 2 3 →