On the public citation graph

A tableau system for linear-TIME temporal logic

https://doi.org/10.1007/bfb0035385
0 signed · 29 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.1007/3-540-56732-1openalex-snapshot
Resolution Methods for the Decision Problem
inferredcites →https://doi.org/10.1007/3-540-59293-8_237openalex-snapshot
STeP: The Stanford Temporal Prover
inferredcites →https://doi.org/10.1007/3-540-61474-5_92openalex-snapshot
STeP: Deductive-algorithmic verification of reactive and real-time systems
inferredcites →https://doi.org/10.1007/978-1-4612-0931-7openalex-snapshot
The Temporal Logic of Reactive and Concurrent Systems
inferredcites →https://doi.org/10.1007/978-1-4612-4222-2openalex-snapshot
Temporal Verification of Reactive Systems
inferredcites →https://doi.org/10.1007/bfb0014007openalex-snapshot
Improving temporal logic tableaux using integer constraints
inferredcites →https://doi.org/10.1016/0196-6774(91)90036-xopenalex-snapshot
Incremental algorithms for minimal length paths
inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1090/qam/102435openalex-snapshot
On a routing problem
inferredcites →https://doi.org/10.1145/3828.3837openalex-snapshot
The complexity of propositional linear temporal logics

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10722086_26openalex-snapshot
The Mosaic Method for Temporal Logics
inferred← citeshttps://doi.org/10.1007/11554554_14openalex-snapshot
An Order-Sorted Quantified Modal Logic for Meta-ontology
inferred← citeshttps://doi.org/10.1007/3-540-48242-3_5openalex-snapshot
First Order Linear Temporal Logic over Finite Time Structures
inferred← citeshttps://doi.org/10.1007/3-540-48754-9_21openalex-snapshot
A Tableau Calculus for a Temporal Logic with Temporal Connectives
inferred← citeshttps://doi.org/10.1007/3-540-69778-0_18openalex-snapshot
Bounded Model Search in Linear Temporal Logic and Its Application to Planning
inferred← citeshttps://doi.org/10.1007/978-3-540-45206-5_1openalex-snapshot
Non Commutative Logic: A Survey (Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-540-45206-5_10openalex-snapshot
A General Tableau Method for Propositional Interval Temporal Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-02716-1_9openalex-snapshot
Decidability for Priorean Linear Time Using a Fixed-Point Labelled Calculus
inferred← citeshttps://doi.org/10.1007/978-90-481-8785-0_9openalex-snapshot
Logics of Linear Frames
inferred← citeshttps://doi.org/10.1007/978-94-011-4040-9_6openalex-snapshot
Labelled Tableaux for Propositional Linear Time Logic Over Finite Frames
inferred← citeshttps://doi.org/10.1007/bfb0057441openalex-snapshot
Using linear temporal logic to model and solve planning problems
inferred← citeshttps://doi.org/10.1007/s10817-006-9051-0openalex-snapshot
An Optimal Decision Procedure for Right Propositional Neighborhood Logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.07.007openalex-snapshot
Game Over: The Foci Approach to LTL Satisfiability and Model Checking
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.04.014openalex-snapshot
A History of Until
inferred← citeshttps://doi.org/10.1016/j.jal.2005.06.006openalex-snapshot
Methods for modalities 3
inferred← citeshttps://doi.org/10.1016/j.jal.2005.06.012openalex-snapshot
A general tableau method for propositional interval temporal logics: Theory and implementation
inferred← citeshttps://doi.org/10.1093/logcom/exp022openalex-snapshot
Labelled Tableaux for Distributed Temporal Logic
inferred← citeshttps://doi.org/10.1109/time.2008.21openalex-snapshot
A Labeled Tableaux System for the Distributed Temporal Logic DTL
inferred← citeshttps://doi.org/10.3166/jancl.20.241-277openalex-snapshot
Back from the future
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.