Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Paul Ruet"'
Linear logic is a branch of proof theory which provides refined tools for the study of the computational aspects of proofs. These tools include a duality-based categorical semantics, an intrinsic graphical representation of proofs, the introduction o
Autor:
Paul Ruet
Publikováno v:
Natural Computing. 14:545-553
The study of relationships between structure and dynamics of asynchronous Boolean networks has recently led to the introduction of hereditarily bijective maps and even or odd self-dual networks. We show here that these two notions can be simply chara
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0d4ed54a98bc063dee501d44ae35d13f
https://doi.org/10.1007/s11047-015-9523-4
https://doi.org/10.1007/s11047-015-9523-4
Autor:
Paul Ruet
Publikováno v:
Mathematical Structures in Computer Science. 26:702-718
We investigate the relationships between the dynamical properties of Boolean networks and properties of their Jacobian matrices, in particular the existence of local cycles in the associated interaction graphs. We define the notion of hereditarily bi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::24f2b58ded0c1ac849d53daab2680073
https://doi.org/10.1017/s096012951400036x
https://doi.org/10.1017/s096012951400036x
Autor:
Adrien Richard, Paul Ruet
Publikováno v:
Discrete Applied Mathematics
Discrete Applied Mathematics, Elsevier, 2013, 161 (7-8), pp.1106-1117. ⟨10.1016/j.dam.2012.10.022⟩
Discrete Applied Mathematics, Elsevier, 2013, 161 (7-8), pp.1106-1117. ⟨10.1016/j.dam.2012.10.022⟩
International audience; We consider a class of Boolean networks called and-nets, and we address the question of whether the absence of negative cycle in local interaction graphs implies the existence of a fixed point. By defining correspondences with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e0d29b765aa28d9093a3876fe1ca3130
https://doi.org/10.1016/j.dam.2012.10.022
https://doi.org/10.1016/j.dam.2012.10.022
Autor:
Paul Ruet
We study the asymptotic dynamical properties of Boolean networks without local negative cycle. While the properties of Boolean networks without local cycle or without local positive cycle are rather well understood, recent literature raises the follo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4059a61ee007e2bfce29995683b17afc
Autor:
Roberto Maieli, Paul Ruet
Publikováno v:
Information and Computation. 185:233-262
It is now well-established that the so-called focalization property plays a central role in the design of programming languages based on proof search, and more generally in the proof theory of linear logic. We present here a sequent calculus for non-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::16f93d99074b3e8cf15b813515aa9a90
https://doi.org/10.1016/s0890-5401(03)00084-1
https://doi.org/10.1016/s0890-5401(03)00084-1
Publikováno v:
Information and Computation
Information and Computation, Elsevier, 2001, 165 (1), pp.14--41. ⟨10.1006/inco.2000.3002⟩
Information and Computation, 2001, 165 (1), pp.14--41. ⟨10.1006/inco.2000.3002⟩
Information and Computation, Elsevier, 2001, 165 (1), pp.14--41. ⟨10.1006/inco.2000.3002⟩
Information and Computation, 2001, 165 (1), pp.14--41. ⟨10.1006/inco.2000.3002⟩
International audience; In this paper we give a logical semantics for the class CC of concurrent constraint programming languages and for its extension LCC based on linear constraint systems. Besides the characterization in intuitionistic logic of th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::55192d0ff1450dbb0bc655d92aa2755e
https://doi.org/10.1006/inco.2000.3002
https://doi.org/10.1006/inco.2000.3002
Autor:
Paul Ruet
Publikováno v:
Mathematical Structures in Computer Science. 10:277-312
Non-commutative logic, which is a unification of commutative linear logic and cyclic linear logic, is extended to all linear connectives: additives, exponentials and constants. We give two equivalent versions of the sequent calculus (directly with th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a86020ad3fe8f6565a769a7295307729
https://doi.org/10.1017/s0960129599003084
https://doi.org/10.1017/s0960129599003084
Autor:
V. Michele Abrusci, Paul Ruet
Publikováno v:
Annals of Pure and Applied Logic. 101:29-64
We introduce proof nets and sequent calculus for the multiplicative fragment of non-commutative logic, which is an extension of both linear logic and cyclic linear logic. The two main technical novelties are a third switching position for the non-com
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e532ba778dee77ff92c3282e6f9a790a
https://doi.org/10.1016/s0168-0072(99)00014-7
https://doi.org/10.1016/s0168-0072(99)00014-7
Autor:
Paul Ruet, Elisabeth Remy
Publikováno v:
Bioinformatics
Bioinformatics, Oxford University Press (OUP), 2008, 24 (16), ⟨10.1093/bioinformatics/btn287⟩
Bioinformatics, Oxford University Press (OUP), 2008, 24 (16), pp.i220-i226. ⟨10.1093/bioinformatics/btn287⟩
Bioinformatics, 2008, 24 (16), pp.i220-i226. ⟨10.1093/bioinformatics/btn287⟩
Bioinformatics, 2008, 24 (16), ⟨10.1093/bioinformatics/btn287⟩
ECCB
Bioinformatics, Oxford University Press (OUP), 2008, 24 (16), ⟨10.1093/bioinformatics/btn287⟩
Bioinformatics, Oxford University Press (OUP), 2008, 24 (16), pp.i220-i226. ⟨10.1093/bioinformatics/btn287⟩
Bioinformatics, 2008, 24 (16), pp.i220-i226. ⟨10.1093/bioinformatics/btn287⟩
Bioinformatics, 2008, 24 (16), ⟨10.1093/bioinformatics/btn287⟩
ECCB
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 such as multistability (involved in differentiation) and periodic osc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4715cffce4985d4d762e0cff9a56cb83
https://pubmed.ncbi.nlm.nih.gov/18689829
https://pubmed.ncbi.nlm.nih.gov/18689829