AbstractWe study three fragments of multiplicative linear logic with circular exchange, respectively LLNC containing all propositional variables, LLNCa builded on a single variable and the constant-only fragment LLNC0.By using non-commutative proofnets, we show that the decision problems of these fragments are polynomially equivalent
In this paper we propose new calculi for the multiplicative fragment of Non-commutative Logic (MNL)...
We construct several simple algebraic models of the multiplicative and multi-plicative-additive frag...
Article dans revue scientifique avec comité de lecture.This paper presents an algorithm for automate...
AbstractWe investigate three fragments of cyclic linear logic, respectively, LLNC containing all pro...
AbstractWe introduce proof nets and sequent calculus for the multiplicative fragment of non-commutat...
AbstractIt is well-known that every proof net of a non-commutative version of MLL (Multiplicative fr...
Linear logic (LL) is very expressive: the smallest propositonal fragment is already NP-complete and ...
AbstractLinear logic is a resource-aware logic that is based on an analysis of the classical proof r...
This paper concerns a logical approach to natural language parsing based on proof nets (PNs), i.e. d...
This paper concerns a logical approach to natural language parsing based on proof nets (PNs), i.e. d...
This paper presents a simple and intuitive syntax for proof nets of the multiplicative cyclic fragme...
AbstractProof nets can be seen as a multiple conclusion natural deduction system for Linear Logic (L...
AbstractWe present a full completeness theorem for the multiplicative fragment of a variant of nonco...
Colloque avec actes et comité de lecture. internationale.International audienceIn this paper we stud...
We introduce a new correctness criterion for multiplicative non commutative proof nets which can be ...
In this paper we propose new calculi for the multiplicative fragment of Non-commutative Logic (MNL)...
We construct several simple algebraic models of the multiplicative and multi-plicative-additive frag...
Article dans revue scientifique avec comité de lecture.This paper presents an algorithm for automate...
AbstractWe investigate three fragments of cyclic linear logic, respectively, LLNC containing all pro...
AbstractWe introduce proof nets and sequent calculus for the multiplicative fragment of non-commutat...
AbstractIt is well-known that every proof net of a non-commutative version of MLL (Multiplicative fr...
Linear logic (LL) is very expressive: the smallest propositonal fragment is already NP-complete and ...
AbstractLinear logic is a resource-aware logic that is based on an analysis of the classical proof r...
This paper concerns a logical approach to natural language parsing based on proof nets (PNs), i.e. d...
This paper concerns a logical approach to natural language parsing based on proof nets (PNs), i.e. d...
This paper presents a simple and intuitive syntax for proof nets of the multiplicative cyclic fragme...
AbstractProof nets can be seen as a multiple conclusion natural deduction system for Linear Logic (L...
AbstractWe present a full completeness theorem for the multiplicative fragment of a variant of nonco...
Colloque avec actes et comité de lecture. internationale.International audienceIn this paper we stud...
We introduce a new correctness criterion for multiplicative non commutative proof nets which can be ...
In this paper we propose new calculi for the multiplicative fragment of Non-commutative Logic (MNL)...
We construct several simple algebraic models of the multiplicative and multi-plicative-additive frag...
Article dans revue scientifique avec comité de lecture.This paper presents an algorithm for automate...
DOI
Add to ORKG