We present a formal language to specify cognitive systems. In addition to the usual characteristics of these formalisms, our language features the possibility of including …
FL Pelayo, ML Pelayo, JLG Guirao - Journal of computational and applied …, 2007 - Elsevier
We present a couple of programs (over C and Mathematica) which allow to generate the syntactic and the semantics representations of a ROSA (ReasoningOnStochasticAlgebras) …
In this article we present the formal language STOchastic Process Algebra (STOPA) to specify cognitive systems. In addition to the usual characteristics of these formalisms, this …
L Llana, M Núuñez - Fundamenta Informaticae, 2009 - content.iospress.com
Abstract The language RTPA, Real Time Process Algebra, has been created to enable rigorous treatment of knowledge representation and manipulation in terms of to be I to …
In this paper we have used the Markovian process algebra ROSA to both specify and analyze the memorizing process. ROSA, reasoning on stochastic algebras, is an algebraic …
During the last years it has been widely recognized that formal semantic frameworks improve the capability to represent cognitive processes. In this line, process algebras have …
Genetic algorithms, GA's are metaheuristic techniques that have obtained good results in problems in which exhaustive techniques fail due to the size of the search space. GA's have …
Genetic Algorithms, GA's are metaheuristic techniques that have obtained good results in problems in which exhaustive techniques fail due to the size of the search space. GA's [21 …
Process Algebras, PAs, are formalisms able to capture the behaviour of a computing system by, for example, giving the labelled transition system, LTS, where states are nodes and …