![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
International Journal of Approximate Reasoning, Volume 173
Volume 173, 2024
- Radim Belohlávek, Martin Trnecka
:
Semantic explorations in factorizing Boolean data via formal concepts. 109247 - Alexandre Bazin
, Thomas Georges, Marianne Huchard, Pierre Martin, Chouki Tibermacine:
Exploring the 3-dimensional variability of websites' user-stories using triadic concept analysis. 109248 - Qing He, Wuniu Liu, Yong-Ming Li:
Generalized possibility computation tree logic with frequency and its model checking. 109249 - Shaoxia Zhang, Yanhui Zhai, Deyu Li, Chao Zhang
:
Learning multi-granularity decision implication in correlative data from a logical perspective. 109250 - Miao Liu, Ping Zhu
:
Fuzzy object-induced network three-way concept lattice and its attribute reduction. 109251 - Aditi Shenvi, Silvia Liverani
:
Beyond conjugacy for chain event graph model selection. 109252 - Zhenxi Chen, Gong Chen, Can Gao
, Jie Zhou, Jiajun Wen:
Robust weighted fuzzy margin-based feature selection with three-way decision. 109253 - Bo Wen Fang
:
Difference operators on fuzzy sets. 109254 - Timotheus Kampik
, Nico Potyka, Xiang Yin, Kristijonas Cyras, Francesca Toni:
Contribution functions for quantitative bipolar argumentation graphs: A principle-based analysis. 109255 - Nguyen Ngoc Thuy, Sartra Wongthanavasu:
Attribute reduction with fuzzy divergence-based weighted neighborhood rough sets. 109256
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.