Score: 0

Non-expansive Fuzzy ALC

Published: May 14, 2025 | arXiv ID: 2505.09416v2

By: Stefan Gebhart, Lutz Schröder, Paul Wild

Potential Business Impact:

Helps computers understand fuzzy ideas better.

Business Areas:
Natural Language Processing Artificial Intelligence, Data and Analytics, Software

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 Lukasiewicz 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 Lukasiewicz 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.

Country of Origin
🇩🇪 Germany

Page Count
12 pages

Category
Computer Science:
Logic in Computer Science