( en | de | ru )

 

Disambiguation of "Mogbil, Virgile"

Author of the publication

copydeleteadd this publication to your clipboard
Correctness of Multiplicative (and Exponential) Proof Structures is NL -Complete.

, and . CSL, volume 4646 of Lecture Notes in Computer Science, page 435-450. Springer, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Virgile Prevosto

Virgile Taver

Virgile Fritsch

 

Other publications of authors with the same name

Soft lambda-calculus: a language for polynomial time computation, and . CoRR, (2003)Soft lambda-Calculus: A Language for Polynomial Time Computation., and . FoSSaCS, volume 2987 of Lecture Notes in Computer Science, page 27-41. Springer, (2004)Uniform Circuits, & Boolean Proof Nets., and . LFCS, volume 4514 of Lecture Notes in Computer Science, page 401-421. Springer, (2007)An Interpretation of CCS into Ludics., and . LSFA, volume 338 of Electronic Notes in Theoretical Computer Science, page 97-114. Elsevier, (2017)Quadratic Correctness Criterion for Non-commutative Logic.. CSL, volume 2142 of Lecture Notes in Computer Science, page 69-83. Springer, (2001)Correctness of linear logic proof structures is NL-complete., and . Theor. Comput. Sci., 412 (20): 1941-1957 (2011)Rewritings for Polarized Multiplicative and Exponential Proof Structures., and . TERMGRAPH@ETAPS, volume 203 of Electronic Notes in Theoretical Computer Science, page 109-121. Elsevier, (2007)Encoding Hamiltonian circuits into multiplicative linear logic., and . Theor. Comput. Sci., 266 (1-2): 987-996 (2001)Sémantique des phases, réseaux de preuve et divers problèmes de décision en logique linéaire. (Phase semantics, proof nets and some decision problems in linear logic).. University of the Mediterranean, Marseille, France, (2001)Rewriting Systems for Reachability in Vector Addition Systems with Pairs., and . RP, volume 6227 of Lecture Notes in Computer Science, page 133-145. Springer, (2010)