Non-expansive fuzzy modal logic supports modular reasoning with uniform interpolation
Non-Expansive Fuzzy Modal Logic Has Uniform Interpolation
Logic in Computer Science
Summary
Fuzzy modal logics let computers handle uncertain or in-between truth values, but some versions are either too complicated to use efficiently or lack useful properties. The authors focus on a middle-ground version called non-expansive fuzzy modal logic, which balances expressiveness and computational ease. They show this version has a useful feature called uniform interpolation, allowing parts of logical statements to be isolated or simplified without losing important information. This property helps with building and maintaining complex logical systems by supporting modular design and information hiding.
What this means in practice
- •For knowledge representation engineers: Support modular design and summarization of logical knowledge bases using uniform interpolation in non-expansive fuzzy modal logic.
- •For description logic developers: Enable satisfiability checking with the same complexity as classical modal logic in systems extending fuzzy reasoning for semantic web and AI.
A theory result. No direct application yet.
Authors
Stefan Gebhart, Lutz Schröder, Paul Wild
Abstract
Fuzzy logics with truth values in the unit interval vary in their choice of propositional connectives and their semantics, ranging from just minimum and maximum as in Zadeh logics to truncated addition and subtraction as in Łukasiewicz logics or their extensions with truth constants, known as Pavelka logics. In the more specific world of fuzzy modal logics, non-expansive fuzzy modal logic has recently been proposed as a sweet spot between Łukasiewicz (more precisely, Pavelka) and Zadeh fuzzy modal logic; it restricts Łukasiewicz propositional connectives to have one argument constant, equivalently extends the Zadeh propositional base with constant shift operators. It retains reasonable expressiveness both in practical terms and abstractly; in particular, it characterizes the standard notion of behavioural distance on fuzzy Kripke frames. At the same time, it allows for satisfiability checking in the same complexity as for its two-valued correspondent (the modal logic K, or the description logic ALC), in contrast to the notorious computational hardness of Łukasiewicz modal logic. In the present work, we show that non-expansive fuzzy modal logic admits uniform interpolation, a key property in modularization, information hiding, summarization, and other applications that fails for both Łukasiewicz (or Pavelka) and Zadeh modal logic.