loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 23rd Annual IEEE Symposium on Logic in Computer Science
Correctness of Multiplicative Additive Proof Structures is NL-Complete
June 24-June 27
ISBN: 978-0-7695-3183-0
ASCII Text
x 
 
Paulin Jacob? de Naurois, Virgile Mogbil, "Correctness of Multiplicative Additive Proof Structures is NL-Complete," Logic in Computer Science, Symposium on, pp. 476-485, 2008 23rd Annual IEEE Symposium on Logic in Computer Science, 2008.
 
 
BibTex
x
 
@article{ 10.1109/LICS.2008.20,
author = {Paulin Jacob? de Naurois and Virgile Mogbil},
title = {Correctness of Multiplicative Additive Proof Structures is NL-Complete},
journal ={Logic in Computer Science, Symposium on},
volume = {0},
year = {2008},
issn = {1043-6871},
pages = {476-485},
doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2008.20},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Logic in Computer Science, Symposium on
TI - Correctness of Multiplicative Additive Proof Structures is NL-Complete
SN - 1043-6871
SP476
EP485
A1 - Paulin Jacob? de Naurois,
A1 - Virgile Mogbil,
PY - 2008
KW - Computational Complexity
KW - Correctness Criterion
KW - Multiplicative Additive Linear Logic
KW - NL-completness
KW - proof-nets
VL - 0
JA - Logic in Computer Science, Symposium on
ER -
 
We revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding proof structures is NL-complete.
Index Terms:
Computational Complexity, Correctness Criterion, Multiplicative Additive Linear Logic, NL-completness, proof-nets
Citation:
Paulin Jacob? de Naurois, Virgile Mogbil, "Correctness of Multiplicative Additive Proof Structures is NL-Complete," lics, pp.476-485, 2008 23rd Annual IEEE Symposium on Logic in Computer Science, 2008
Usage of this product signifies your acceptance of the Terms of Use.