A deductive solution for plan generation
New Generation Computing
Theoretical Computer Science
Automated deduction in nonclassical logics
Automated deduction in nonclassical logics
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
On proof normalization in linear logic
MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
Constant-only multiplicative linear logic is NP-complete
MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
Forum: a multiple-conclusion specification logic
ALP Proceedings of the fourth international conference on Algebraic and logic programming
Theorem Proving via General Matings
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Efficient resource management for linear logic proof search
Theoretical Computer Science - Special issue on proof-search in type-theoretic languages
Connection methods in linear logic and proof nets construction
Theoretical Computer Science - Special issue on proof-search in type-theoretic languages
A uniform procedure for converting matrix proofs into sequent-style systems
Information and Computation
A Procedure for Automatic Proof Nets Construction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Generating Plans in Linear Logic
Proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science
T-String Unification: Unifying Prefixes in Non-classical Proof Methods
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Connection-Based Proof Construction in Linear Logic
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Resource-Distribution via Boolean Constraint (Extended Abstract)
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
JProver: Integrating Connection-Based Theorem Proving into Interactive Proof Assistants
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Connections in nonclassical logics
Handbook of automated reasoning
| Hi-index | 0.00 |
We develop a matrix characterization of logical validity in MELL, the multiplicative fragment of propositional linear logic with exponentials and constants. To prove the correctness and completeness of our characterization, we use a purely proof-theoretical justification rather than semantical arguments. Our characterization is based on concepts similar to matrix characterizations proposed by Wallen for other nonclassical logics. It provides a foundation for developing proof search procedures for MELL by adopting techniques that are based on these concepts and also makes it possible to adopt algorithms that translate the machine-found proofs back into the usual sequent calculus for MELL.