Abstract
Description logics (DLs) play an important role in representing and reasoning domain knowledge. Conjunctive queries stemmed from the domain of relational databases, and have attracted more attentions in semantic Web recently. To acquire a tractable DL for query answering, DL-Lite is proposed. Due to the large amount of imprecision and uncertainty in the real world, it is essential to extend DLs to deal with these vague and imprecise information. We thus propose a new fuzzy DL f-DLR-Liteℱ⊓, which allows for the presence of n-ary relations and the occurrence of concept conjunction on the left land of inclusion axioms. We also suggest an improved fuzzy query language, which supports the presence of thresholds and user defined weights. We also show that the query answering algorithm over the extended DL is still FOL reducible and shows polynomial data complexity. DL f-DLR-Liteℱ⊓ can make up for the disadvantages of knowledge representation and reasoning of classic DLs, and the enhanced query language expresses user intentions more precisely and reasonably.
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.
