Fuzzy cognitive maps (FCMs) theory is a powerful approach to modeling human knowledge based on causal reasoning. Taking advantages of fuzzy logic and cognitive maps theories, FCMs enable system designers to model complex frameworks by defining degrees of causality between causal objects. They can be used to model and represent the behavior of simple and complex systems by capturing and emulating the human being in describing and presenting systems in terms of tolerance, imprecision and granulation of information. However, FCMs lack the temporal concept that is crucial in many real-world applications and they do not offer formal mechanisms to verify the behavior of systems being represented, which limit the conventional FCMs in knowledge representation. In this paper we present an extension to FCMs by exploiting a theory from formal languages, namely, the Timed Automata, which bridges the aforementioned inadequacies. Indeed, the theory of Timed Automata enables FCMs to effectively deal with a double-layered temporal granularity extending the standard idea of B-Time that characterizes the iterative nature of cognitive inference engine, and offering model checking techniques to test the cognitive and dynamic comportment of the framework being designed.
On the Temporal Granularity in Fuzzy Cognitive Maps
ACAMPORA, GIOVANNI;LOIA, Vincenzo
2011-01-01
Abstract
Fuzzy cognitive maps (FCMs) theory is a powerful approach to modeling human knowledge based on causal reasoning. Taking advantages of fuzzy logic and cognitive maps theories, FCMs enable system designers to model complex frameworks by defining degrees of causality between causal objects. They can be used to model and represent the behavior of simple and complex systems by capturing and emulating the human being in describing and presenting systems in terms of tolerance, imprecision and granulation of information. However, FCMs lack the temporal concept that is crucial in many real-world applications and they do not offer formal mechanisms to verify the behavior of systems being represented, which limit the conventional FCMs in knowledge representation. In this paper we present an extension to FCMs by exploiting a theory from formal languages, namely, the Timed Automata, which bridges the aforementioned inadequacies. Indeed, the theory of Timed Automata enables FCMs to effectively deal with a double-layered temporal granularity extending the standard idea of B-Time that characterizes the iterative nature of cognitive inference engine, and offering model checking techniques to test the cognitive and dynamic comportment of the framework being designed.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
