Abstract
Fuzzy Description Logics are a formalism for the representation of structured knowledge affected by imprecision or vagueness. They have become popular as a language for fuzzy ontology representation. To date, most of the work in this direction has focused on the so-called Zadeh family of fuzzy operators (or fuzzy logic), which has several limitations. In this paper, we generalize existing proposals and show how to reason with a fuzzy extension of the logic SROIQ , the logic behind the language OWL 2, under finitely many-valued Łukasiewicz fuzzy logic. We show for the first time that it is decidable over a finite set of truth values by presenting a reasoning preserving procedure to obtain a non-fuzzy representation for the logic. This reduction makes it possible to reuse current representation languages as well as currently available reasoners for ontologies.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
