![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Fundamenta Informaticae, Volume 148
Volume 148, Numbers 1-2, 2016
- Davide Ciucci
, Dominik Slezak
, Marcin Wolski
:
Preface. v-vi
- Jan Rauch:
Logical Aspects of Dealing with Domain Knowledge in Data Mining with Association Rules. 1-33 - Agnieszka Nowak-Brzezinska
:
Mining Rule-based Knowledge Bases Inspired by Rough Set Theory. 35-50 - Krystyna Napierala, Jerzy Stefanowski
:
Post-processing of BRACID Rules Induced from Imbalanced Data. 51-64 - Marzena Kryszkiewicz:
ACBC-Adequate Association and Decision Rules Versus Key Generators and Rough Sets Approximations. 65-85 - Beata Zielosko
:
Application of Dynamic Programming Approach to Optimization of Association Rules Relative to Coverage and Length. 87-105 - Maciej Kopczynski
, Tomasz Grzes
, Jaroslaw Stepaniuk
:
Rough Sets Based LEM2 Rules Generation Supported by FPGA. 107-122 - Mihir K. Chakraborty:
On Some Issues in the Foundation of Rough Sets: the Problem of Definition. 123-132 - Pradipta Maji
, Ankita Mandal:
Rough Hypercuboid Based Supervised Regularized Canonical Correlation for Multimodal Data Analysis. 133-155 - Marcin Wolski
, Anna Gomolinska:
Rough Granular Computing in Modal Settings: Generalised Approximation Spaces. 157-172 - Anuj Kumar More
, Mohua Banerjee:
Categories and Algebras from Rough Sets: New Facets. 173-190 - Ivo Düntsch
, Ewa Orlowska
, Hui Wang
:
A Relational Logic for Spatial Contact Based on Rough Set Approximation. 191-206 - Giampiero Chiaselotti, Davide Ciucci
, Tommaso Gentile, Federico Infusino
:
Generalizations of Rough Set Tools Inspired by Graph Theory. 207-227 - Krzysztof Pancerz
:
Paradigmatic and Syntagmatic Relations in Information Systems over Ontological Graphs. 229-242
Volume 148, Numbers 3-4, 2016
- Suna Bensch
, Rudolf Freund, Mika Hirvensalo, Friedrich Otto:
Preface. i-ii
- Cezar Câmpeanu
, Nelma Moreira
, Rogério Reis
:
Distinguishability Operations and Closures. 243-266 - Markus Holzer
, Sebastian Jakobi, Matthias Wendlandt:
On the Computational Complexity of Partial Word Automata Problems. 267-289 - Oscar H. Ibarra:
Visibly Pushdown Automata and Transducers with Counters. 291-308 - Lukás Krtek, Frantisek Mráz
:
Two-Dimensional Limited Context Restarting Automata. 309-340 - Martin Kutrib
, Andreas Malcher
, Matthias Wendlandt:
Reversible Queue Automata. 341-368 - Giovanni Pighizzini:
Strongly Limited Automata. 369-392
![](https://dblp1.uni-trier.de/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.