Connection methods in linear logic and proof nets construction

DOI10.1016/S0304-3975(99)00176-0zbMath0951.03055WikidataQ126382659 ScholiaQ126382659MaRDI QIDQ1575926

Didier Galmiche

Publication date: 23 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

automated deductionproof netmultiplicative linear logicadditive fragmentfragments of linear logicproof-search connection method

Mathematics Subject Classification ID

Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items

Unnamed Item, On compatibilities of \(\alpha \)-lock resolution method in linguistic truth-valued lattice-valued logic, Machine learning guidance for connection tableaux

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A deductive solution for plan generation
• Linear logic
• Forum: A multiple-conclusion specification logic
• What is the inverse method?
• A decidable fragment of predicate calculus
• A decision procedure revisited: Notes on direct logic, linear logic and its implementation
• Decision problems for propositional linear logic
• The structure of multiplicatives
• Resolution calculus for the first order linear logic
• Linear logic as a logic of computations
• Proof strategies in linear logic
• On proof normalization in linear logic
• Sequent reconstruction in LLM -- A sweepline proof
• Theorem Proving via General Matings
• On Matrices with Connections
• Some Syntactical Observations on Linear Logic
• Logic Programming with Focusing Proofs in Linear Logic
• Contraction-free sequent calculi for intuitionistic logic
• Applications of Linear Logic to Computation: An Overview
• Proof-search in intuitionistic logic based on constraint satisfaction
• Converting non-classical matrix proofs into sequent-style systems
• Connection-based proof construction in linear logic