Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

Parallel Algorithms for Fuzzy Ontology Reasoning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bobillo, F. ; Dept. of Comput. Sci. & Syst. Eng., Univ. of Zaragoza, Zaragoza, Spain ; Delgado, M. ; Sanchez-Sanchez, J.C.

The need to deal with imprecise and vague information in ontologies is rising in importance, as required by several real-world application domains. As a consequence, there is a growing interest in fuzzy ontologies, which combine ontologies and fuzzy logic theory. In fuzzy ontologies, some reasoning tasks usually become harder to solve, such as the concept subsumption problem and the computation of the Best Degree Bound (BDB) of an axiom. In fact, the current existing algorithms to solve these problems usually require performing some simpler tests several times. In this paper, we present a parallelization of these algorithms, implemented in the DeLorean reasoner, and discuss the encouraging results of an empirical evaluation.

Published in:

Fuzzy Systems, IEEE Transactions on  (Volume:21 ,  Issue: 4 )