Non-expansive Fuzzy ALC

Gebhart S, Schröder L, Wild P (2025)


Publication Type: Conference contribution

Publication year: 2025

Journal

Publisher: International Joint Conferences on Artificial Intelligence

Pages Range: 4509-4517

Conference Proceedings Title: IJCAI International Joint Conference on Artificial Intelligence

Event location: Montreal, QC, CAN CA

ISBN: 9781956792065

DOI: 10.24963/ijcai.2025/502

Abstract

Fuzzy description logics serve the representation of vague knowledge, typically letting concepts take truth degrees in the unit interval. Expressiveness, logical properties, and complexity vary strongly with the choice of propositional base. The Łukasiewicz propositional base is generally perceived to have preferable logical properties but often entails high complexity or even undecidability. Contrastingly, the less expressive Zadeh propositional base comes with low complexity but entails essentially no change in logical behaviour compared to the classical case. To strike a balance between these poles, we propose non-expansive fuzzy ALC, in which the Zadeh base is extended with Łukasiewicz connectives where one side is restricted to be a rational constant, that is, with constant shift operators. This allows, for instance, modelling dampened inheritance of properties along roles. We present an unlabelled tableau method for non-expansive fuzzy ALC, which allows reasoning over general TBoxes in EXPTIME like in two-valued ALC.

Authors with CRIS profile

How to cite

APA:

Gebhart, S., Schröder, L., & Wild, P. (2025). Non-expansive Fuzzy ALC. In James Kwok (Eds.), IJCAI International Joint Conference on Artificial Intelligence (pp. 4509-4517). Montreal, QC, CAN, CA: International Joint Conferences on Artificial Intelligence.

MLA:

Gebhart, Stefan, Lutz Schröder, and Paul Wild. "Non-expansive Fuzzy ALC." Proceedings of the 34th Internationa Joint Conference on Artificial Intelligence, IJCAI 2025, Montreal, QC, CAN Ed. James Kwok, International Joint Conferences on Artificial Intelligence, 2025. 4509-4517.

BibTeX: Download