Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

On Certain Rough Inclusion Functions
Anna Gomolińska
Lecture notes in computer science (2008), pp. 35-55
Closed Access | Times Cited: 25

Showing 25 citing articles:

Quantitative rough sets based on subsethood measures
Yiyu Yao, Xiaofei Deng
Information Sciences (2014) Vol. 267, pp. 306-322
Closed Access | Times Cited: 85
Dialectics of Counting and the Mathematics of Vagueness
A. Mani
Lecture notes in computer science (2012), pp. 122-180
Closed Access | Times Cited: 39
Distance-based double-quantitative rough fuzzy sets with logic operations
Wentao Li, Witold Pedrycz, Xiaoping Xue, et al.
International Journal of Approximate Reasoning (2018) Vol. 101, pp. 206-233
Open Access | Times Cited: 29
Automated Discovery of Properties of Rough Sets
Adam Grabowski
Fundamenta Informaticae (2013) Vol. 128, Iss. 1-2, pp. 65-79
Closed Access | Times Cited: 29
Contamination-free measures and algebraic operations
A. Mani
2022 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE) (2013), pp. 1-8
Open Access | Times Cited: 19
On the properties of subsethood measures
Mengjun Hu, Xiaofei Deng, Yiyu Yao
Information Sciences (2019) Vol. 494, pp. 208-232
Closed Access | Times Cited: 14
Inclusion degree with variable-precision model in analyzing inconsistent decision tables
Yu-Ru Syau, Andrzej Skowron, En-Bing Lin
Granular Computing (2016) Vol. 2, Iss. 2, pp. 65-72
Open Access | Times Cited: 13
Rough Approximation Based on Weak q-RIFs
Anna Gomolińska
Lecture notes in computer science (2009), pp. 117-135
Closed Access | Times Cited: 15
Rough Inclusion Functions and Similarity Indices
Anna Gomolińska, Marcin Wolski
Fundamenta Informaticae (2014) Vol. 133, Iss. 2-3, pp. 149-163
Open Access | Times Cited: 9
Three-Way Classification Models
Xiaofei Deng
(2015)
Closed Access | Times Cited: 7
A Logic-Algebraic Approach to Graded Inclusion
Anna Gomolińska
Fundamenta Informaticae (2011) Vol. 109, Iss. 3, pp. 265-279
Closed Access | Times Cited: 6
Satisfiability Judgement under Incomplete Information
Anna Gomolińska
Lecture notes in computer science (2010), pp. 66-91
Closed Access | Times Cited: 4
High Granular Operator Spaces, and Less-Contaminated General Rough Mereologies
A. Mani
arXiv (Cornell University) (2018)
Closed Access | Times Cited: 4
On Approximation of Relations by Generalized Closures and Generalized Kernels
A. Bogobowicz, Ryszard Janicki
Lecture notes in computer science (2016), pp. 120-130
Closed Access | Times Cited: 3
Dialectics of Counting and the Mathematics of Vagueness
A. Mani
arXiv (Cornell University) (2014)
Open Access | Times Cited: 2
On Graded Nearness of Sets
Anna Gomolińska, Marcin Wolski
Fundamenta Informaticae (2012) Vol. 119, Iss. 3-4, pp. 301-317
Closed Access | Times Cited: 2
Building a Framework of Rough Inclusion Functions by Means of Computerized Proof Assistant
Adam Grabowski
Lecture notes in computer science (2019), pp. 225-238
Closed Access | Times Cited: 2
Formal Development of Rough Inclusion Functions
Adam Grabowski
Formalized Mathematics (2019) Vol. 27, Iss. 4, pp. 337-345
Open Access | Times Cited: 2
Dialectics of Counting and Measures of Rough Theories
A. Mani
arXiv (Cornell University) (2011)
Open Access | Times Cited: 1
On some generalization of rough sets
Ryszard Janicki
International Journal of Approximate Reasoning (2023) Vol. 163, pp. 109046-109046
Closed Access
Dialectics of Approximation of Semantics of Rough Sets
Transitive Completion, A. Mani
(2013)
Closed Access
A Fuzzy View on Rough Satisfiability
Anna Gomolińska
Lecture notes in computer science (2010), pp. 227-236
Closed Access
Computer-Driven Searching for Axiomatization of Rough Sets.
Adam Grabowski
CS&P (2012), pp. 115-122
Closed Access
Developing Complementary Rough Inclusion Functions
Adam Grabowski
Formalized Mathematics (2020) Vol. 28, Iss. 1, pp. 105-113
Open Access
Algebraic Semantics of Generalized RIFs
A. Mani
arXiv (Cornell University) (2021)
Open Access
Page 1

Scroll to top