• Aucun résultat trouvé

Synthesis of Boolean Networks from Biological Dynamical Constraints using Answer-Set Programming

N/A
N/A
Protected

Academic year: 2021

Partager "Synthesis of Boolean Networks from Biological Dynamical Constraints using Answer-Set Programming"

Copied!
9
0
0

Texte intégral

Figure

Fig. 4. Influence graph for CNS development
TABLE II

Références

Documents relatifs

We propose in this paper an extension of the calculus of structures, a deep inference formalism, that supports incremental and contextual reasoning with equality and fixpoints in

We showed the finiteness of two different natural semantics of MALL 2 – an observational quotient of the syntax, and the historical model of coherence spaces and normal functors –

This initial stage receives a (partial) composition, perform an analysis, and returns feedback to the user in the form of error detection and notifications of chords or

We shall look for conditions in general case such that a monotonous solution of equation (E1) becomes continuous.. So far, we studied only the continuous solutions of

Answer Set Programming (ASP) [12, 13, 15, 8] is a logical language for knowledge representation and reasoning that combines a non-monotonic nature, strong the- oretical foundations,

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

It is acknowledged that the presence of positive or negative circuits in regulatory networks such as genetic networks is linked to the emergence of significant dynamical properties

In this case, the laser pump excites the titanium film and, through a thermoelastic process, leads to the generation of picosecond acoustic pulses that propagate within the copper