Sciweavers

47 search results - page 5 / 10
» Proof nets sequentialisation in multiplicative linear logic
Sort
View
LICS
2009
IEEE
14 years 2 months ago
The Inverse Taylor Expansion Problem in Linear Logic
Linear Logic is based on the analogy between algebraic linearity (i.e. commutation with sums and scalar products) and the computer science linearity (i.e. calling inputs only once...
Michele Pagani, Christine Tasson
LICS
2008
IEEE
14 years 1 months ago
Correctness of Multiplicative Additive Proof Structures is NL-Complete
We revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding proof structures is NLcomple...
Paulin Jacobé de Naurois, Virgile Mogbil
APAL
2005
97views more  APAL 2005»
13 years 7 months ago
Polarized and focalized linear and classical proofs
We give the precise correspondence between polarized linear logic and polarized classical logic. The properties of focalization and reversion of linear proofs are at the heart of ...
Olivier Laurent, Myriam Quatrini, Lorenzo Tortora ...
LICS
1999
IEEE
13 years 12 months ago
Full Completeness of the Multiplicative Linear Logic of Chu Spaces
We prove full completeness of multiplicative linear logic (MLL) without MIX under the Chu interpretation. In particular we show that the cut-free proofs of MLL theorems are in a n...
Harish Devarajan, Dominic J. D. Hughes, Gordon D. ...
TCAD
2010
130views more  TCAD 2010»
13 years 2 months ago
On ATPG for Multiple Aggressor Crosstalk Faults
Crosstalk faults have emerged as a significant mechanism for circuit failure. Long signal nets are of particular concern because they tend to have a higher coupling capacitance to...
Kunal P. Ganeshpure, Sandip Kundu