Institut
de Mathématiques de Luminy
| BIBLIOGRAPHIE - Paul RUET |
|
Année
|
Publications
|
Files | Type |
2008 |
Ille Pierre, Ruet Paul. Cyclic extensions of order varieties. Foundations of Informatics, Computing and Software, ENTCS 212: 119-132, 2008 |
lien | ACL |
| Remy Élisabeth, Ruet Paul, Thieffry Denis. Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework. Advances in Applied Mathematics 41(3): 335-350, 2008 |
ACL | ||
| Crumière Anne, Ruet Paul. Spatial differentiation and positive circuits in a discrete framework. Development of Computational Models, ENTCS 192: 85-100, 2008 |
ACL | ||
| Remy Élisabeth, Ruet Paul. From minimal signed circuits to the dynamics of Boolean regulatory networks. Bioinformatics 24: i200-i226, 2008. |
ACL | ||
2007 |
Remy Élisabeth, Ruet Paul. On differentiation and homeostatic behaviours of Boolean dynamical systems. Transactions on Computational Systems Biology VIII, Springer LNCS 4780: 92-101, 2007. |
ACTI | |
2006 |
Remy Élisabeth, Ruet Paul, Mendoza Luis, Thieffry Denis, Chaouiya Claudine. From logical regulatory graphs to standard Petri nets: dynamical roles and functionality of feedback circuits. Transactions on Computational Systems Biology VI, Springer LNCS 4220, 2006. |
ACTI | |
Remy Élisabeth, Ruet Paul, Thieffry Denis. |
ACTI | ||
| Remy Élisabeth, Ruet Paul. On differentiation and homeostatic behaviours of Boolean dynamical systems. Transactions on Computational Systems Biology VII, Springer LNCS 4230: 153--162, 2006. |
|||
| Andreoli Jean-Marc, Maieli Roberto, Ruet Paul. Non-commutative proof construction: a constraint-based approach. Ann. Pure Appl. Logic 142(1-3) : 212--244, 2006. |
ACL | ||
2005 |
Andreoli Jean-Marc, Pulcini Gabriele, Ruet Paul. Permutative logic. Computer science logic , 184--199, Lecture Notes in Comput. Sci., 3634, Springer, Berlin, 2005. |
||
2004 |
Ehrhard Thomas, Girard Jean-Yves, Ruet Paul, Scott Philip. Linear logic in computer science. Papers from the Azores Summer School held in St. Miguel, August 30--September 7, 2000. Edited by Thomas Ehrhard, Jean-Yves Girard, Paul Ruet and Philip Scott. London Mathematical Society Lecture Note Series 316, Cambridge University Press, x+381 pp. ISBN: 0-521-60857-0, 2004. |
link | |
Chaouiya Claudine, Remy Élisabeth, Ruet Paul, Thieffry Denis. |
|||
| 2003 | Maieli Roberto, Ruet Paul. Non-commutative logic III : focusing proofs. Information and Computation, 185(2): 233-262, 2003. |
||
| 2002 | Blute Rick, Lamarche François, Ruet Paul. |
link | |
| 2001 | Fages François, Ruet
Paul and Soliman Sylvain. Linear concurrent constraint programming: operational and phase semantics. Inform. and Comput., vol.165, no.1, pp.14--41, 2001. |
||
| 2000 | Ruet Paul. Non-commutative logic. II. Sequent calculus and phase semantics. The Lambek Festschrift : mathematical structures in computer science (Montreal, QC, 1997). Math. Structures Comput. Sci. 10, no. 2, 277--312, 2000. |
||
| Abrusci Vito Michele and Ruet
Paul. Non-commutative logic. I. The multiplicative fragment. Ann. Pure Appl. Logic 101, no. 1, 29--64, 2000. |
| 1998 | Ruet Paul and Fages François. Concurrent constraint programming and non-commutative logic. Computer science logic (Aarhus, 1997), 406--423, Lecture Notes in Comput. Sci., 1414, Springer, Berlin, 1998. |
|
| Fages François, Ruet
Paul and Soliman Sylvain. Phase semantics and verification of concurrent constraint programs. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Indianapolis, IN, 1998), 141--152, IEEE Computer Soc., Los Alamitos, CA, 1998. |
||
| 1997 | Ruet Paul and Fages François. Combining explicit negation and negation by failure via Belnap's logic. Theoret. Comput. Sci. 171, no. 1-2, 61--75, 1997. |
|
| Ruet Paul. Non-commutative linear logic with mobilities. Bulletin of Symbolic Logic 3(2): 274--275, 1997. |
link | |
| 1996 | Ruet Paul. Logical semantics of concurrent constraint programming. Constraint Programming, Springer LNCS 1118: 397--409, 1996. |
|
Thèse
|
(Thesis)
|
|
| 1997 | Logique non-commutative et programmation concurrente par contraintes
[ Non-commutative logic and concurrent constraint programming]. Thèse de doctorat en Logique et Fondements de l'Informatique effectuée à l'Ecole Normale Supérieure et dans l'Equipe de logique de l'Université Denis Diderot, Paris 7, 1996 |
|