On the public citation graph

Resolution calculus for the first order linear logic

https://doi.org/10.1007/bf01051768
0 signed · 28 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.
Claim with ORCID
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.
See reference health

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/bf03037173openalex-snapshot
Linear objects: Logical processes with built-in inheritance
inferredcites →https://doi.org/10.1016/0168-0072(91)90068-wopenalex-snapshot
Uniform proofs as a foundation for logic programming
inferredcites →https://doi.org/10.1016/0304-3975(87)90045-4openalex-snapshot
Linear logic
inferredcites →https://doi.org/10.1109/lics.1991.151628openalex-snapshot
Logic programming in a fragment of intuitionistic linear logic

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

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/11538363_15openalex-snapshot
Focusing the Inverse Method for Linear 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-63385-5_33openalex-snapshot
Resolution, inverse method and the sequent calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-85983-0_11openalex-snapshot
Resolution Strategies for the Intuitionistic Logic
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/bf00885763openalex-snapshot
Proof strategies in linear logic
inferred← citeshttps://doi.org/10.1007/bfb0054276openalex-snapshot
Towards efficient subsumption
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50006-0openalex-snapshot
The Inverse Method
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50007-2openalex-snapshot
Normal Form Transformations
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.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.1145/371316.371511openalex-snapshot
How to optimize proof-search in modal logics
inferred← citeshttps://doi.org/10.1184/r1/6609062openalex-snapshot
Resource Management for the Inverse Method in Linear Logic
inferred← citeshttps://doi.org/10.1184/r1/6610634openalex-snapshot
The inverse method for intuitionistic linear logic : (the propositional fragment)
inferred← citeshttps://doi.org/10.18260/1-2-1153-53936openalex-snapshot
Narrative analysis: The Personal Experience Narrative approach
inferred← citeshttps://doi.org/10.3233/fun-2006-71403openalex-snapshot
Foundations of Paraconsistent Resolution
inferred← citeshttps://doi.org/10.4204/eptcs.292.7openalex-snapshot
The ILLTP Library for Intuitionistic Linear Logic
inferred← citeshttps://doi.org/10.70675/b8a908cfzea79z4efdza9dezd3589d30dd25openalex-snapshot
Designing an Automated Concurrent Tableau-Based Theorem Prover for First-Order Logic
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.