Zobrazeno 1 - 10
of 93
pro vyhledávání: '"Moreno Falaschi"'
Publikováno v:
Mathematics, Vol 12, Iss 15, p 2422 (2024)
Reaction Systems (RSs) are a computational framework inspired by biochemical mechanisms. An RS defines a finite set of reactions over a finite set of entities (molecules, proteins, etc). Starting from an initial set of entities (the initial state), a
Externí odkaz:
https://doaj.org/article/af8e364f5e544247aeb7d9e84b295bda
Publikováno v:
Neural Computing and Applications. 35:6335-6359
Reaction systems (RSs) are a successful natural computing framework inspired by chemical reaction networks. A RS consists of a set of entities and a set of reactions. Entities can enable or inhibit each reaction and are produced by reactions or provi
Publikováno v:
Practical Aspects of Declarative Languages ISBN: 9783031248405
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::019c0b4a20d7fc6dafa451df254e5334
https://doi.org/10.1007/978-3-031-24841-2_8
https://doi.org/10.1007/978-3-031-24841-2_8
Publikováno v:
Functional and Constraint Logic Programming ISBN: 9783030753320
WFLP
WFLP
Reaction Systems (RSs) are a successful computational framework inspired by biological systems. A RS pairs a set of entities with a set of reactions over them. Entities can be used to enable or inhibit each reaction, and are produced by reactions. En
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f5f5da631586da362a6a04bf0b28b8d1
http://hdl.handle.net/11568/1106503
http://hdl.handle.net/11568/1106503
Reaction Systems (RSs) are a successful computational framework inspired by biological systems. A RS pairs a set of entities with a set of reactions over them. Entities can be used to enable or inhibit each reaction, and are produced by reactions. En
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c5cd427dfd56ccacc29e4119cd225dc2
http://hdl.handle.net/11365/1140022
http://hdl.handle.net/11365/1140022
Publikováno v:
Theory and Practice of Natural Computing ISBN: 9783030904241
TPNC
TPNC
Reaction Systems (RSs) are a successful natural computing framework inspired by chemical reaction networks. A RS consists of a set of entities and a set of reactions. Entities can enable or inhibit each reaction, and are produced by reactions or prov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1548a2225135712d49560f2c59a432a5
http://hdl.handle.net/11365/1197675
http://hdl.handle.net/11365/1197675
In the area of Natural Computing, Reaction Systems (RSs) are a qualitative abstraction inspired by the functioning of living cells, suitable to model the main mechanisms of biochemical reactions. RSs interact with a context, and pose challenges for m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9d0ca545feec3044c6d0567916ae52a7
http://hdl.handle.net/11568/1106499
http://hdl.handle.net/11568/1106499
Publikováno v:
Natural Computing. 17:345-373
Systems biology is a research area devoted to developing computational frameworks for modeling biological systems in a holistic fashion. Within this approach, the typical advantages of using computer systems and formal methodologies are applicable. E
Publikováno v:
Fundamenta Informaticae
Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, In press
Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2020, 177 (3-4), pp.331-357. ⟨10.3233/FI-2020-1992⟩
Fundamenta Informaticae, 2020, 177 (3-4), pp.331-357. ⟨10.3233/FI-2020-1992⟩
Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, In press
Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2020, 177 (3-4), pp.331-357. ⟨10.3233/FI-2020-1992⟩
Fundamenta Informaticae, 2020, 177 (3-4), pp.331-357. ⟨10.3233/FI-2020-1992⟩
International audience; Concurrent Constraint Programming (CCP) is a declarative model for concurrency where agents interact by telling and asking constraints (pieces of information) in a shared store. Some previous works have developed (approximated
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5bbb85bea2de01d359aa9e269fc9ddc9
https://hal.archives-ouvertes.fr/hal-02423973
https://hal.archives-ouvertes.fr/hal-02423973
Autor:
Moreno Falaschi, Carlos Olarte
Publikováno v:
Logic-Based Program Synthesis and Transformation ISBN: 9783030138370
LOPSTR
HAL
LOPSTR
HAL
Constraint Logic Programming (CLP) is a language scheme for combining two declarative paradigms: constraint solving and logic programming. Concurrent Constraint Programming (CCP) is a declarative model for concurrency where agents interact by telling
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c7d71d7d31b462353ab4a7a6d97d6852
http://hdl.handle.net/11365/1088089
http://hdl.handle.net/11365/1088089