Name
Abstract | ||
|---|---|---|
Pawlak’s rough set and its extension, covering-based rough set, are important techniques for reasoning in incomplete information systems. In this paper, by studying some results about the Feynman paths, we show that the family of all fixed points of covering upper and lower approximation operators is an atomic frame and a complete lattice, respectively. Then, we find a relation between some major causal operators of relativity theory and covering approximation operators. As a result of this connection, we introduce a Feynman index to classify space–times. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s00500-019-04113-0 | Soft Computing |
Keywords | Field | DocType |
Covering-based, Rough set, Causal structure, Space–time, Frame | Space time,Causal structure,Algebra,Computer science,Theoretical computer science,Theory of relativity,Rough set,Operator (computer programming),Fixed point,Complete lattice,Feynman diagram | Journal |
Volume | Issue | ISSN |
23 | 22 | 1432-7643 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. A. Estaji | 1 | 0 | 0.34 |
| M. Vatandoost | 2 | 1 | 1.07 |
| R. Pourkhandani | 3 | 0 | 0.34 |