Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2510.21423 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911421569171456 |
|---|---|
| author | Nguyen, Linh Anh |
| author_facet | Nguyen, Linh Anh |
| contents | The problem of minimizing fuzzy interpretations in fuzzy description logics (FDLs) is important both theoretically and practically. For instance, fuzzy or weighted social networks can be modeled as fuzzy interpretations, where individuals represent actors and roles capture interactions. Minimizing such interpretations yields more compact representations, which can significantly improve the efficiency of reasoning and analysis tasks in knowledge-based systems. We present the first algorithm that minimizes a finite fuzzy interpretation while preserving fuzzy concept assertions in FDLs without the Baaz projection operator and the universal role, under the Gödel semantics. The considered class of FDLs ranges from the sublogic of $f\!\mathcal{ALC}$ without the union operator and universal restriction to the FDL that extends $f\!\mathcal{ALC}_{reg}$ with inverse roles and nominals. Our algorithm is given in an extended form that supports approximate preservation: it minimizes a finite fuzzy interpretation $\mathcal{I}$ while preserving fuzzy concept assertions up to a degree $γ\in (0,1]$. Its time complexity is $O((m\log{l} + n)\log{n})$, where $n$ is the size of the domain of $\mathcal{I}$, $m$ is the number of nonzero instances of atomic roles in $\mathcal{I}$, and $l$ is the number of distinct fuzzy values used in such instances plus 2. Methodologically, our approach fundamentally differs from existing ones, as it avoids quotient constructions traditionally employed for minimizing fuzzy interpretations and fuzzy automata. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_21423 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Approximate minimization of interpretations in fuzzy description logics under the Gödel semantics Nguyen, Linh Anh Data Structures and Algorithms The problem of minimizing fuzzy interpretations in fuzzy description logics (FDLs) is important both theoretically and practically. For instance, fuzzy or weighted social networks can be modeled as fuzzy interpretations, where individuals represent actors and roles capture interactions. Minimizing such interpretations yields more compact representations, which can significantly improve the efficiency of reasoning and analysis tasks in knowledge-based systems. We present the first algorithm that minimizes a finite fuzzy interpretation while preserving fuzzy concept assertions in FDLs without the Baaz projection operator and the universal role, under the Gödel semantics. The considered class of FDLs ranges from the sublogic of $f\!\mathcal{ALC}$ without the union operator and universal restriction to the FDL that extends $f\!\mathcal{ALC}_{reg}$ with inverse roles and nominals. Our algorithm is given in an extended form that supports approximate preservation: it minimizes a finite fuzzy interpretation $\mathcal{I}$ while preserving fuzzy concept assertions up to a degree $γ\in (0,1]$. Its time complexity is $O((m\log{l} + n)\log{n})$, where $n$ is the size of the domain of $\mathcal{I}$, $m$ is the number of nonzero instances of atomic roles in $\mathcal{I}$, and $l$ is the number of distinct fuzzy values used in such instances plus 2. Methodologically, our approach fundamentally differs from existing ones, as it avoids quotient constructions traditionally employed for minimizing fuzzy interpretations and fuzzy automata. |
| title | Approximate minimization of interpretations in fuzzy description logics under the Gödel semantics |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2510.21423 |