![](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
Tamás Mihálydeák
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Tamás Mihálydeák, Tamás Kádek, Dávid Nagy, Mihir K. Chakraborty:
Intensions and extensions of granules: A two-component treatment. Int. J. Approx. Reason. 169: 109182 (2024) - 2022
- [j3]Péter Battyányi, Tamás Mihálydeák, György Vaszil:
Rough-Set-Like Approximation Spaces for Formal Languages. J. Autom. Lang. Comb. 27(1-3): 79-90 (2022) - [c29]Carolin Hannusch
, Tamás Mihálydeák:
Algebraic structures gained from rough approximation in incomplete information systems. FedCSIS (Communication Papers) 2022: 73-77 - 2020
- [c28]Tamás Mihálydeák:
Logical Treatment of Incomplete/Uncertain Information Relying on Different Systems of Rough Sets. IFIP TC12 ICIS 2020: 66-78 - [c27]Dávid Nagy, Tamás Mihálydeák, Tamás Kádek:
Similarity-Based Rough Sets with Annotation Using Deep Learning. IFIP TC12 ICIS 2020: 93-102 - [c26]Dávid Nagy, Tamás Mihálydeák, Tamás Kádek:
Similarity Based Granules. IJCRS 2020: 35-47
2010 – 2019
- 2019
- [j2]Dávid Nagy
, Tamás Mihálydeák
, László Aszalós
:
Different Types of Search Algorithms for Rough Sets. Acta Cybern. 24(1): 105-120 (2019) - [c25]Péter Battyányi
, Tamás Mihálydeák, György Vaszil:
Generalized Membrane Systems with Dynamical Structure, Petri Nets, and Multiset Approximation Spaces. UCNC 2019: 15-29 - [e1]Tamás Mihálydeák, Fan Min, Guoyin Wang, Mohua Banerjee, Ivo Düntsch, Zbigniew Suraj, Davide Ciucci:
Rough Sets - International Joint Conference, IJCRS 2019, Debrecen, Hungary, June 17-21, 2019, Proceedings. Lecture Notes in Computer Science 11499, Springer 2019, ISBN 978-3-030-22814-9 [contents] - 2018
- [c24]Dávid Nagy, Tamás Mihálydeák
, László Aszalós:
Similarity Based Rough Sets with Annotation. IJCSR 2018: 88-100 - [c23]Tamás Mihálydeák
:
Logic on Similarity Based Rough Sets. IJCSR 2018: 270-283 - 2017
- [c22]Dávid Nagy, Tamás Mihálydeák
, László Aszalós:
Similarity Based Rough Sets. IJCRS (2) 2017: 94-107 - 2015
- [c21]László Aszalós, Tamás Mihálydeák:
Rough Classification in Incomplete Databases by Correlation Clustering. IFSA-EUSFLAT 2015 - [c20]Tamás Kádek, Tamás Mihálydeák:
On (in)Validity of Aristotle's Syllogisms Relying on Rough Sets. LQMR@FedCSIS 2015: 35-40 - [c19]László Aszalós, Tamás Mihálydeák
:
Correlation clustering by contraction. FedCSIS 2015: 425-434 - [c18]Tamás Mihálydeák
, György Vaszil:
Regulating Rule Application with Membrane Boundaries in P Systems. Int. Conf. on Membrane Computing 2015: 304-320 - 2014
- [j1]Tamás Mihálydeák, Zoltán Erno Csajbók:
On the Membrane Computations in the Presence of Membrane Boundaries. J. Autom. Lang. Comb. 19(1-4): 227-238 (2014) - [c17]Zoltán Erno Csajbók, Tamás Mihálydeák
:
Maximal Parallelism in Membrane Systems with Generated Membrane Boundaries. CiE 2014: 103-112 - [c16]Tamás Mihálydeák
:
First-Order Logic Based on Set Approximation: A Partial Three-Valued Approach. ISMVL 2014: 132-137 - [c15]Tamás Kádek, Tamás Mihálydeák:
Some Fundamental Laws of Partial First-Order Logic Based on Set Approximations. RSCTC 2014: 47-58 - [c14]Tamás Mihálydeák
:
Aristotle's Syllogisms in Logical Semantics Relying on Optimistic, Average and Pessimistic Membership Functions. RSCTC 2014: 59-70 - [c13]Zoltán Erno Csajbók, Tamás Mihálydeák
:
From Vagueness to Rough Sets in Partial Approximation Spaces. RSEISP 2014: 42-52 - [c12]Davide Ciucci
, Tamás Mihálydeák, Zoltán Erno Csajbók:
On Definability and Approximations in Partial Approximation Spaces. RSKT 2014: 15-26 - [c11]László Aszalós, Tamás Mihálydeák
:
Rough Classification Based on Correlation Clustering. RSKT 2014: 399-410 - 2013
- [c10]Zoltán Erno Csajbók, Tamás Mihálydeák
, József Ködmön:
An Adequate Representation of Medical Data Based on Partial Set Approximation. CISIM 2013: 120-128 - [c9]Tamás Mihálydeák:
Partial first-order logic relying on optimistic, pessimistic and average partial membership functions. EUSFLAT Conf. 2013 - [c8]Zoltán Erno Csajbók, Tamás Mihálydeák:
Fuzziness in Partial Approximation Framework. FedCSIS 2013: 35-41 - [c7]Tamás Mihálydeák
, Zoltán Erno Csajbók, Péter Takács:
Communication Rules Controlled by Generated Membrane Boundaries. Int. Conf. on Membrane Computing 2013: 265-279 - [c6]László Aszalós, Tamás Mihálydeák
:
Rough Clustering Generated by Correlation Clustering. RSFDGrC 2013: 315-324 - [c5]Tamás Mihálydeák
, Zoltán Erno Csajbók:
Partial Approximation of Multisets and Its Applications in Membrane Computing. RSKT 2013: 99-108 - 2012
- [c4]Zoltán Csajbók, Tamás Mihálydeák
:
A General Set Theoretic Approximation Framework. IPMU (1) 2012: 604-612 - [c3]Tamás Mihálydeák
, Zoltán Erno Csajbók:
Membranes with Boundaries. Int. Conf. on Membrane Computing 2012: 277-294 - [c2]Tamás Mihálydeák
:
Partial First-order Logic with Approximative Functors Based on Properties. RSKT 2012: 514-523 - 2011
- [c1]Zoltán Csajbók, Tamás Mihálydeák
:
General Tool-Based Approximation Framework Based on Partial Approximation of Sets. RSFDGrC 2011: 52-59
Coauthor Index
![](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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-22 21:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint