Deciding Query Entailment for Fuzzy $\mathcal{SHIN}$ Ontologies

The existing ontology reasoners are all unilaterally description logic-based or rule-based, and their abilities to deal with fuzzy ontology are limited. It is the diversity of fuzzy ontology representation methods among them that leads to a low processing efficiency of fuzzy ontology. To solve this bottle-neck problem of fuzzy ontology-based knowledge reasoning, fuzzy ontology, fuzzy ontology representation method and fuzzy description logic are investigated, and the existing fuzzy ontology reasoners are comparatively analyzed. By virtue of the advantages of the typical reasoners such as Pellet, JenaAPI and fuzzyDL (fuzzy Description Logic), a method combining rule and description logic reasoning is designed, and a framework about fuzzy ontology based knowledge reasoning is proposed. By reducing fuzzy ontology, checking consistency and repairing inconsistency, the efficiency and accuracy of fuzzy ontology based knowledge reasoning can be improved. Finally, an experiment is given to verify the validity of proposed method.

Reasoning within expressive fuzzy rough description logics

Bipolarity is an important feature of spatial information, involved in the expression of preferences and constraints about spatial positioning or in pairs of opposite spatial relations such as left and right. Another important feature is imprecision which has to be taken into account to model vagueness, inherent to many spatial relations (as for instance vague expressions such as close to, to the right of), and to gain in robustness in the representations. In previous works, we have shown that fuzzy sets and fuzzy mathematical morphology are appropriate frameworks, on the one hand, to represent bipolarity and imprecision of spatial relations and, on the other hand, to combine qualitative and quantitative reasoning in description logics extended with fuzzy concrete domains. The purpose of this paper is to integrate the bipolarity feature in the latter logical framework based on bipolar and fuzzy mathematical morphology and description logics with fuzzy concrete domains. Two important issues are addressed in this paper: the modeling of the bipolarity of spatial relations at the terminological level and the integration of bipolar notions in fuzzy description logics. At last, we illustrate the potential of the proposed formalism for spatial reasoning on a simple example in brain imaging.

Classical Description Logics (DLs) are not suitable to represent vague pieces of information. The attempts to achieve a solution have lead to the birth of fuzzy DLs and rough DLs. In this work, we provide a simple solution to join these two formalisms and define a fuzzy rough DL. We also show how to extend two reasoning algorithms for fuzzy DLs, which are implemented in the fuzzy DL reasoners fuzzyDL and DeLorean.KeywordsDescription LogicVague ConceptReasoning AlgorithmIndiscernibility RelationLukasiewicz LogicThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Consistency reasoning in lattice-based fuzzy Description Logics

Extending fuzzy soft sets with fuzzy description logics

Fuzzy Description Logics (DLs) are a formalism for the representation of structured knowledge that is imprecise or vague by nature. In fuzzy DLs, restricting to a finite set of degrees of truth has proved to be useful, both for theoretical and practical reasons. In this paper, we propose finite fuzzy DLs as a generalization of existing approaches. We assume a finite totally ordered set of linguistic terms or labels, which is very useful in practice since expert knowledge is usually expressed using linguistic terms. Then, we consider fuzzy DLs based on any smooth t-norm defined over this set. Initially we focus on the finite fuzzy DL \(\mathcal{ALCH}\), studying some logical properties, and showing the decidability of the logic by presenting a reasoning preserving reduction to the classical case. Finally, we extend our logic in two directions: by considering non-smooth t-norms and by considering additional DL constructors.

To satisfy the need of representing and reasoning with fuzzy knowledge and fuzzy data information in the context of the Semantic Web, an expressive fuzzy Description Logic (DL) named f-SROIQ(G) is proposed in this paper. The fuzzy DL f-SROIQ(G) can support not only the representation and reasoning of complex fuzzy OWL 2 concept knowledge, but also fuzzy data information with customized fuzzy data types and predicates. Briefly, the paper makes the following main contributions: (i) we propose a new fuzzy DL f-SROIQ(G), and define its syntax, semantics and knowledge bases. (ii) we propose a tableau algorithm for deciding the reasoning problems of f-SROIQ(G). The work is a step forward in the direction of fuzzy DLs, the representation and reasoning capabilities of f-SROIQ(G) go beyond the existing fuzzy DLs, and it may lay a theoretical foundation for the representation and reasoning of fuzzy data information in the Semantic Web.

Answering regular path queries in expressive Description Logics via alternating tree-automata

The distributed fuzzy ontologies play an important role in semantic web. Most current solutions are proposed respectively on one of these two aspects. To represent distributed fuzzy ontology, we combine fuzzy description logics and E-connections, and present distributed extended fuzzy description logic (DEFSHOIN). This novel logical approach couples both fuzzy and distributed features within description logics. The main contribution of this paper is to propose a combined tableau to achieve reasoning within DEFSHOIN.

Queries with Negation and Inequalities over Lightweight Ontologies

We study the complexity and expressive power of conjunctive queries over unranked labeled trees, where the tree structure are represented using such as child, descendant, and following (we consider a superset of the XPath axes) as well as unary relations for node labels. (Cyclic) conjunctive queries over trees occur in a wide range of data management scenarios related to XML, the Web, and computational linguistics. We establish a framework for characterizing structures representing trees for which conjunctive queries can be evaluated efficiently. Then we completely chart the tractability frontier of the problem for our axis relations, i.e., we find all subset maximal sets of axes for which query evaluation is in polynomial time. All polynomial-time results are obtained immediately using the proof techniques from our framework. Finally, we study the expressiveness of conjunctive queries over trees and compare it to the expressive power of fragments of XPath. We show that for each conjunctive query, there is an equivalent acyclic positive query (i.e., a set of acyclic conjunctive queries), but that in general this query is not of polynomial size.

Description logics are appropriate, widely used, logics for managing strudtured knowledge.

Description logics (DLs) are modern knowledge representation formalisms which are used today in many applications for reasoning with structured knowledge. Moreover, they are used in the semantic web (an extension of the current web) through the ontology language OWL. On the other hand fuzzy description logics (fuzzy-DLs) have been proposed as expressive logical formalisms capable of capturing and reasoning with

Fuzzy Description Logics are logics which allow to deal with structured knowledge affected by vagueness. Although a relatively important amount of work has been carried out in the last years, fuzzy DLs are open to be extended with several features worked out in other fields. In this work, we start addressing the problem of incorporating Multi-Criteria Decision Making (MCDM) into fuzzy Description Logics and, thus, start an investigation about offering the possibility of a fuzzy ontology assisted approach to decision making.KeywordsFuzzy NumberDescription LogicDecision MatrixOptimal AlternativeMCDM MethodThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.