On the public citation graph

A Modal Characterization of Indiscernibility and Similarity Relations in Pawlak’s Information Systems

https://doi.org/10.1007/11548669_2
0 signed · 28 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-662-04997-6openalex-snapshot
Incomplete Information: Structure, Inference, Complexity
inferredcites →https://doi.org/10.1007/978-3-7908-1888-8openalex-snapshot
Incomplete Information: Rough Set Analysis
inferredcites →https://doi.org/10.1007/978-3-7908-1888-8_16openalex-snapshot
Information Systems, Similarity Relations and Modal Logics
inferredcites →https://doi.org/10.1007/bf01053038openalex-snapshot
A duality between Pawlak's knowledge representation systems and bi-consequence systems
inferredcites →https://doi.org/10.1016/0304-3975(84)90010-0openalex-snapshot
Representation of nondeterministic information
inferredcites →https://doi.org/10.1017/cbo9781107050884openalex-snapshot
Modal Logic

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-74826-5_6openalex-snapshot
Logical Treatment of Incomplete/Uncertain Information Relying on Different Systems of Rough Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-27683-0_25openalex-snapshot
Intransitive Temporal Multi-agent’s Logic, Knowledge and Uncertainty, Plausibility
inferred← citeshttps://doi.org/10.1007/978-3-319-69917-2_11openalex-snapshot
Linear Temporal Logic with Non-transitive Time, Algorithms for Decidability and Verification of Admissibility
inferred← citeshttps://doi.org/10.1007/978-3-319-99368-3_21openalex-snapshot
Logic on Similarity Based Rough Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-88425-5_28openalex-snapshot
Feature Selection Based on the Rough Set Theory and Expectation-Maximization Clustering Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-28667-4_2openalex-snapshot
Rough Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-30344-9_3openalex-snapshot
Rough Sets: From Rudiments to Challenges
inferred← citeshttps://doi.org/10.1007/978-3-642-36505-8_9openalex-snapshot
Approximation of Sets Based on Partial Covering
inferred← citeshttps://doi.org/10.1016/j.ijar.2026.109753openalex-snapshot
Towards a logic of affordances
inferred← citeshttps://doi.org/10.1016/j.ins.2006.06.003openalex-snapshot
Rudiments of rough sets
inferred← citeshttps://doi.org/10.1016/j.ins.2020.05.074openalex-snapshot
Rough concepts
inferred← citeshttps://doi.org/10.1016/j.procs.2020.08.008openalex-snapshot
Representation of Information and Satisfiability, Algorithms for Multi-Agent Logics
inferred← citeshttps://doi.org/10.1080/11663081.2024.2336377openalex-snapshot
Modal reduction principles: a parametric shift to graphs
inferred← citeshttps://doi.org/10.1093/logcom/exv016openalex-snapshot
Non-transitive linear temporal logic and logical knowledge operations
inferred← citeshttps://doi.org/10.1134/s0037446617050147openalex-snapshot
Nontransitive temporal multiagent logic, information and knowledge, deciding algorithms
inferred← citeshttps://doi.org/10.1155/2014/243070openalex-snapshot
Matroidal Structure of Generalized Rough Sets Based on Tolerance Relations
inferred← citeshttps://doi.org/10.33048/semi.2019.16.079openalex-snapshot
Branching time agents' logic, satisfiability problem by rules in reduced form
inferred← citeshttps://doi.org/10.48550/arxiv.1209.5456openalex-snapshot
Relation matroid and its relationship with generalized rough set based on relation
inferred← citeshttps://doi.org/10.48550/arxiv.1405.0559openalex-snapshot
A Note on Parameterised Knowledge Operations in Temporal Logic
inferred← citeshttps://doi.org/10.48550/arxiv.1406.2783openalex-snapshot
Linear Non-Transitive Temporal Logic, Knowledge Operations, Algorithms for Admissibility
inferred← citeshttps://doi.org/10.48550/arxiv.1406.5495openalex-snapshot
Knowledge Representation in Agent's Logic with Uncertainty and Agent's Interaction
inferred← citeshttps://doi.org/10.48550/arxiv.1503.08761openalex-snapshot
Intransitive Linear Temporal Logic, Knowledge from Past, Decidability, Admissible Rules
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.