V. M. Abrusci, Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic, The Journal of Symbolic Logic, vol.55, issue.04, pp.1403-1451, 1991.
DOI : 10.1090/conm/092/1003197

V. M. Abrusci and E. Maringelli, A new correctness criterion for cyclic multiplicative proofnetsSpecial Issue on Recent Advances in Logical and Algebraic Approaches to Grammar, Journal of Logic, Language and Information, vol.7, issue.4, pp.449-459, 1998.
DOI : 10.1023/A:1008354130493

V. M. Abrusci and P. Ruet, Non-commutative logic I: the multiplicative fragment', Annals of Pure and Applied Logic, 1999.

D. Bechet, P. De-groote, and C. Retoré, A complete axiomatisation of the inclusion of seriesparallel partial orders, Rewriting Techniques and Applications, RTA'97, pp.230-240, 1997.

B. Bollobás, Modern Graph Theory, Graduate Texts in Mathematics, vol.184, 1998.
DOI : 10.1007/978-1-4612-0619-4

P. De-groote, Partially commutative linear logic: sequent calculus and phase semanticsThird Roma Workshop: Proofs and Linguistics Categories ? Applications of Logic to the analysis and implementation of Natural Language, pp.199-208, 1996.

J. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-102, 1987.
DOI : 10.1016/0304-3975(87)90045-4

URL : https://hal.archives-ouvertes.fr/inria-00075966

A. Guglielmi, A calculus of order and interaction, 1999.

A. Guglielmi and L. Straßburger, Non-commutativity and MELL in the Calculus of Structures, Lecture Notes in Computer Science, vol.2142, pp.54-68, 2001.
DOI : 10.1007/3-540-44802-0_5

J. Lambek, The mathematics of sentence structure', American mathematical monthly pp, pp.154-170, 1958.

E. Maringelli, Grafi e logica lineare: una nuova definizione delle reti dimostrative non commutative , Tesi di laurea (Graphs and linear logic: a new definition of non-commutative proof-nets.), 1996.

R. H. Möhring, Computationally tractable classes of ordered sets, in I. Rival, Algorithms and Order', vol.255, pp.105-194, 1989.

R. Moot, Graph algorithms for improving type-logical proof search, in 'Proceedings of Categorial Grammars?an efficient tool for natural language processing', pp.13-28, 2004.

S. Pogodalla, Lexicalized proof-nets and TAGsLogical Aspects of Computational Linguistics, LACL'98, selected papers', number, LNCS/LNAI, pp.230-250, 2001.

S. Pogodalla, Réseaux de preuve et génération pour les grammaires de types logiques, Thèse de doctorat, 2001.

C. Retoré, Réseaux et Séquents Ordonnés, Thèse de Doctorat, spécialité Mathématiques, 1993.

C. Retoré, Calcul de Lambek et logique linéaire, Traitement Automatique des Langues, vol.37, issue.2, pp.39-70, 1996.

C. Retoré, Perfect matchings and series-parallel graphs: multiplicatives proof nets as R&B-graphs, Electronic Notes in Theoretical Computer Science, vol.3, 1996.
DOI : 10.1016/S1571-0661(05)80416-5

C. Retoré, Pomset logic: a non-commutative extension of classical linear logicTyped Lambda Calculus and Applications, TLCA'97, LNCS, vol.1210, pp.300-318, 1997.

C. Retoré, Pomset logic as a calculus of directed cographsDynamic Perspectives in Logic and Linguistics: Proof Theoretical Dimensions of Communication Processes, Proceedings of the 4th, pp.221-247, 1999.

C. Retoré, Handsome proof-nets: perfect matchings and cographs, Theoretical Computer Science, vol.294, issue.3, pp.473-488, 2003.
DOI : 10.1016/S0304-3975(01)00175-X

D. Roorda, Resource logic: proof theoretical investigations, 1991.

P. Ruet, Logique non-commutative et programmation concurrente, Thèse de doctorat, spécialité logique et fondements de l'informatique, 1997.

I. Schena, Pomset logic and discontinuity in natural languageLogical Aspects of Computational Linguistics, LACL'96, LNCS/LNAI, vol.1328, pp.386-405, 1996.

R. E. Tarjan, Depth-First Search and Linear Graph Algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972.
DOI : 10.1137/0201010

J. Valdes, R. E. Tarjan, and E. L. Lawler, The Recognition of Series Parallel Digraphs, SIAM Journal on Computing, vol.11, issue.2, pp.298-313, 1982.
DOI : 10.1137/0211023

I. Unité-de-recherche, . Lorraine, . Loria, and . Technopôle-de-nancy, Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche INRIA Rocquencourt, Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex (France) Unité de recherche INRIA Sophia Antipolis : 2004, route des Lucioles -BP 93 -06902 Sophia Antipolis Cedex

I. De-voluceau-rocquencourt, BP 105 -78153 Le Chesnay Cedex (France) http://www.inria.fr ISSN, pp.249-6399