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:

Rough Approximation Based on Weak q-RIFs
Anna Gomolińska
Lecture notes in computer science (2009), pp. 117-135
Closed Access | Times Cited: 15

Showing 15 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

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

S-APPROXIMATION SPACES: A FUZZY APPROACH
Ali Shakiba, M. R. Hooshmandasl, Bijan Davvaz, et al.
Iranian journal of fuzzy systems (2017) Vol. 14, Iss. 2, pp. 127-154
Closed Access | Times Cited: 13

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

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

Compound approximation spaces for relational data
Piotr Hońko
International Journal of Approximate Reasoning (2016) Vol. 71, pp. 89-111
Open Access | Times Cited: 5

Satisfiability Judgement under Incomplete Information
Anna Gomolińska
Lecture notes in computer science (2010), pp. 66-91
Closed Access | Times Cited: 4

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

Rough-Granular Computing for Relational Data
Piotr Hońko
Studies in computational intelligence (2017), pp. 397-423
Closed Access | Times Cited: 1

A Fuzzy View on Rough Satisfiability
Anna Gomolińska
Lecture notes in computer science (2010), pp. 227-236
Closed Access

Rough Contact in General Rough Mereology
A. Mani
arXiv (Cornell University) (2019)
Open Access

Developing Complementary Rough Inclusion Functions
Adam Grabowski
Formalized Mathematics (2020) Vol. 28, Iss. 1, pp. 105-113
Open Access

Concept Analysis Using Quantitative Structured Three-Way Rough Set Approximations
Mengjun Hu
Lecture notes in computer science (2020), pp. 283-297
Open Access

Page 1

Scroll to top