Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Handbook of logic in artificial intelligence and logic programming (Vol. 4): epistemic and temporal reasoning
Advances in knowledge discovery and data mining
Advances in knowledge discovery and data mining
Fast discovery of association rules
Advances in knowledge discovery and data mining
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Extended Pawlak's Flow Graphs and Information Theory
Transactions on Computational Science V
Interpretation of extended Pawlak flow graphs using granular computing
Transactions on rough sets VIII
Hi-index | 0.00 |
We discuss basic concepts for approximate reasoning about information changes. Any rule for reasoning about information changes specifies how changes of information granules from the rule premise influence changes of information granules from the rule conclusion. Changes in information granules can be measured, e.g., using expressions analogous to derivatives. We illustrate our approach by means of information maps and information granules defined in such maps.