On the public citation graph
Proof strategies in linear logic
0 signed · 52 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1994.1036openalex-snapshot
Logic Programming in a Fragment of Intuitionistic Linear Logic
inferredcites →https://doi.org/10.1007/3-540-52335-9_55openalex-snapshot
Gentzen-type systems and resolution rules part I propositional logic
inferredcites →https://doi.org/10.1007/bf01051768openalex-snapshot
Resolution calculus for the first order linear logic
inferredcites →https://doi.org/10.1007/bfb0023757openalex-snapshot
Provability in TBLL: A decision procedure
inferredcites →https://doi.org/10.1007/bfb0023870openalex-snapshot
Automated deduction in additive and multiplicative linear logic
inferredcites →https://doi.org/10.1016/0168-0072(92)90075-bopenalex-snapshot
Decision problems for propositional linear logic
inferredcites →https://doi.org/10.1016/0304-3975(88)90001-1openalex-snapshot
Fiftieth volume of theoretical computer science
inferredcites →https://doi.org/10.1093/logcom/2.3.297openalex-snapshot
Logic Programming with Focusing Proofs in Linear Logic
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11493402_3openalex-snapshot
Partial Deduction for Linear Logic—The Symbolic Negotiation Perspective
inferred← citeshttps://doi.org/10.1007/11532231_6openalex-snapshot
A Focusing Inverse Method Theorem Prover for First-Order Linear Logic
inferred← citeshttps://doi.org/10.1007/3-540-44404-1_17openalex-snapshot
Proof-Search in Implicative Linear Logic as a Matching Problem
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_3openalex-snapshot
Proof Techniques for Cryptographic Protocols
inferred← citeshttps://doi.org/10.1007/3-540-48754-9_20openalex-snapshot
linTAP : A Tableau Prover for Linear Logic
inferred← citeshttps://doi.org/10.1007/3-540-49545-2_12openalex-snapshot
A Matrix Characterization for $$ \mathcal{M}\mathcal{E}\mathcal{L}\mathcal{L} $$
inferred← citeshttps://doi.org/10.1007/3-540-61208-4_15openalex-snapshot
Strong normalization for all-style LKtq
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_65openalex-snapshot
A resolution theorem prover for intuitionistic logic
inferred← citeshttps://doi.org/10.1007/3-540-63045-7_24openalex-snapshot
Case study: Additive linear logic and lattices
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_20openalex-snapshot
Connection-based proof construction in linear logic
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_21openalex-snapshot
Resource-distribution via Boolean constraints
inferred← citeshttps://doi.org/10.1007/3-540-63385-5_33openalex-snapshot
Resolution, inverse method and the sequent calculus
inferred← citeshttps://doi.org/10.1007/978-3-030-13838-7_5openalex-snapshot
A Pragmatic, Scalable Approach to Correct-by-Construction Process Composition Using Classical Linear Logic Inference
inferred← citeshttps://doi.org/10.1007/978-3-319-63046-5_22openalex-snapshot
WorkflowFM: A Logic-Based Framework for Formal Process Specification and Composition
inferred← citeshttps://doi.org/10.1007/978-3-540-32275-7_31openalex-snapshot
The Inverse Method for the Logic of Bunched Implications
inferred← citeshttps://doi.org/10.1007/978-94-017-2798-3_2openalex-snapshot
Transfer of Sequent Calculus Strategies to Resolution for S4
inferred← citeshttps://doi.org/10.1007/bf03037436openalex-snapshot
Linear logic for deductive databases
inferred← citeshttps://doi.org/10.1007/s00500-011-0779-zopenalex-snapshot
On compatibilities of α-lock resolution method in linguistic truth-valued lattice-valued logic
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00107-7openalex-snapshot
Completeness of a first-order temporal logic with time-gaps
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50007-2openalex-snapshot
Normal Form Transformations
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00244-8openalex-snapshot
Representing scope in intuitionistic deductions
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00311-9openalex-snapshot
From multiple sequent for additive linear logic to decision procedures for free lattices
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00169-3openalex-snapshot
Proof-search in type-theoretic languages: an introduction
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00173-5openalex-snapshot
Efficient resource management for linear logic proof search
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00176-0openalex-snapshot
Connection methods in linear logic and proof nets construction
inferred← citeshttps://doi.org/10.1017/cbo9780511550850.004openalex-snapshot
An Overview of Linear Logic Programming
inferred← citeshttps://doi.org/10.1017/s0960129599002789openalex-snapshot
A specification logic for concurrent object-oriented programming
inferred← citeshttps://doi.org/10.1023/b:jars.0000029976.22387.acopenalex-snapshot
A Matrix Characterization for Multiplicative Exponential Linear Logic
inferred← citeshttps://doi.org/10.1093/logcom/exu032openalex-snapshot
Proof automation for functional correctness in separation logic
inferred← citeshttps://doi.org/10.1109/icsmc.2009.5346601openalex-snapshot
Qualitative analysis of WorkFlow nets using linear logic: Soundness verification
inferred← citeshttps://doi.org/10.1109/lics.2000.855787openalex-snapshot
How to optimize proof-search in modal logics: a new way of proving redundancy criteria for sequent calculi
inferred← citeshttps://doi.org/10.1142/s0218213016500081openalex-snapshot
Linear Logic as a Tool for Qualitative and Quantitative Analysis of Workow Processes
inferred← citeshttps://doi.org/10.1145/1178477.1178583openalex-snapshot
Scenario analysis based on linear logic
inferred← citeshttps://doi.org/10.1145/371316.371511openalex-snapshot
How to optimize proof-search in modal logics
inferred← citeshttps://doi.org/10.1145/601775.601778openalex-snapshot
Resource-distribution via Boolean constraints
inferred← citeshttps://doi.org/10.1184/r1/6609062openalex-snapshot
Resource Management for the Inverse Method in Linear Logic
inferred← citeshttps://doi.org/10.2307/2275572openalex-snapshot
A new deconstructive logic: linear logic
inferred← citeshttps://doi.org/10.3217/jucs-005-03-0088openalex-snapshot
Connection-Based Theorem Proving in Classical and Non-Classical Logics
inferred← citeshttps://doi.org/10.3233/wia-2008-0137openalex-snapshot
Symbolic negotiation: Partial deduction for linear logic with coalition formation
inferred← citeshttps://doi.org/10.4204/eptcs.292.7openalex-snapshot
The ILLTP Library for Intuitionistic Linear Logic
inferred← citeshttps://doi.org/10.5753/sbsi.2009.6163openalex-snapshot
Análise qualitativa e quantitativa de WorkFlow nets utilizando Lógica Linear
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.