2011Advances in data mining and database management book seriesRequires access

Deciding Query Entailment in Fuzzy OWL Lite Ontologies

Jingwei Cheng, Zongmin Ma, Li Yan

Open publisher page 1 citations

Abstract

Significant research efforts in the Semantic Web community are recently directed toward the representation and reasoning with fuzzy ontologies. Description logics (DLs) are the logical foundations of standard Web ontology languages. Conjunctive queries are deemed as an expressive reasoning service for DLs. This chapter focuses on fuzzy (threshold) conjunctive queries over knowledge bases encoding in fuzzy DL , the logic counterpart of fuzzy OWL Lite language. It shows decidability of fuzzy query entailment in this setting by providing a corresponding tableau-based algorithm. The chapter shows data complexity for answering fuzzy conjunctive queries in fuzzy is in coNP, as long as only simple roles occur in the query. Regarding combined complexity, this research proves a co3NExpTime upper bound in the size of the knowledge base and the query.

About this research paper

What this paper is about

Significant research efforts in the Semantic Web community are recently directed toward the representation and reasoning with fuzzy ontologies. Description logics (DLs) are the logical foundations of standard Web ontology languages. Conjunctive queries are deemed as an expressive reasoning service for DLs. This chapter focuses on fuzzy (threshold) conjunctive queries over knowledge bases encoding in fuzzy DL , the logic counterpart of fuzzy OWL Lite language. It shows decidability of fuzzy query entailment in this setting by providing a corresponding tableau-based algorithm. The chapter shows data complexity for answering fuzzy conjunctive queries in fuzzy is in coNP, as long as only simple roles occur in the query. Regarding combined complexity, this research proves a co3NExpTime upper bound in the size of the knowledge base and the query.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Significant research efforts in the Semantic Web community are recently directed toward the representation and reasoning with fuzzy ontologies. Description logics (DLs) are the logical foundations of standard Web ontology languages. Conjunctive queries are deemed as an expressive reasoning service for DLs. This chapter focuses on fuzzy (threshold) conjunctive queries over knowledge bases encoding in fuzzy DL , the logic counterpart of fuzzy OWL Lite language. It shows decidability of fuzzy query entailment in this setting by providing a corresponding tableau-based algorithm. The chapter shows data complexity for answering fuzzy conjunctive queries in fuzzy is in coNP, as long as only simple roles occur in the query. Regarding combined complexity, this research proves a co3NExpTime upper bound in the size of the knowledge base and the query.

Key concepts: Conjunctive query, Description logic, Web Ontology Language, Ontology language, Decidability, Logical consequence, Computer science, Fuzzy logic

Related papers

Back to paper searchBrowse research topicsOriginal source
Deciding Query Entailment in Fuzzy OWL Lite Ontologies — Research Paper | ScholarLens