On the public citation graph

A decision procedure for combinations of propositional temporal logic and other specialized theories

https://doi.org/10.1007/bf02432150
0 signed · 33 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-12896-4_377openalex-snapshot
A low level language for obtaining decision procedures for classes of temporal logics
inferredcites →https://doi.org/10.1007/978-3-642-86718-7openalex-snapshot
First-Order Logic
inferredcites →https://doi.org/10.1007/bfb0000061openalex-snapshot
Deciding combinations of theories
inferredcites →https://doi.org/10.1007/bfb0025786openalex-snapshot
Synthesis of communicating processes from Temporal Logic specifications
inferredcites →https://doi.org/10.1016/0167-6423(83)90017-5openalex-snapshot
Using branching time temporal logic to synthesize synchronization skeletons
inferredcites →https://doi.org/10.1016/0304-3975(83)90097-xopenalex-snapshot
The propositional dynamic logic of deterministic, well-structured programs
inferredcites →https://doi.org/10.1016/s0019-9958(84)80047-9openalex-snapshot
Deciding full branching time logic
inferredcites →https://doi.org/10.1109/sfcs.1977.32openalex-snapshot
The temporal logic of programs
inferredcites →https://doi.org/10.1109/sfcs.1981.44openalex-snapshot
Temporal logic can be more expressive
inferredcites →https://doi.org/10.1137/0210016openalex-snapshot
The Total Correctness of Parallel Programs
inferredcites →https://doi.org/10.1145/322186.322198openalex-snapshot
Fast Decision Procedures Based on Congruence Closure
inferredcites →https://doi.org/10.1145/357073.357079openalex-snapshot
Simplification by Cooperating Decision Procedures
inferredcites →https://doi.org/10.1145/357233.357237openalex-snapshot
Synthesis of Communicating Processes from Temporal Logic Specifications
inferredcites →https://doi.org/10.1145/3828.3837openalex-snapshot
The complexity of propositional linear temporal logics
inferredcites →https://doi.org/10.1145/567532.567550openalex-snapshot
Program logic without binding is decidable
inferredcites →https://doi.org/10.1145/567532.567551openalex-snapshot
The temporal logic of branching time
inferredcites →https://doi.org/10.21236/ada106750openalex-snapshot
Verification of Concurrent Programs. Part I. The Temporal Framework,
inferredcites →https://doi.org/10.21236/ada116035openalex-snapshot
Verification of Concurrent Programs. Part II. Temporal Proof Principles.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-19426-6_4openalex-snapshot
Mendels: Concurrent program synthesis system using temporal logic
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_25openalex-snapshot
Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-74621-8_14openalex-snapshot
Noetherianity and Combination Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-45221-5_3openalex-snapshot
The Complexity of Clausal Fragments of LTL
inferred← citeshttps://doi.org/10.1007/bf01880326openalex-snapshot
TABLEAUX: A general theorem prover for modal logics
inferred← citeshttps://doi.org/10.1007/bfb0014003openalex-snapshot
Annotation-based deduction in temporal logic
inferred← citeshttps://doi.org/10.1007/s10817-010-9192-zopenalex-snapshot
A Decidability Result for the Model Checking of Infinite-State Systems
inferred← citeshttps://doi.org/10.1109/hicss.1990.205176openalex-snapshot
Synthesis of concurrent programs: automated reasoning complements software reuse
inferred← citeshttps://doi.org/10.1111/j.1467-8640.1990.tb00294.xopenalex-snapshot
Time revisited1
inferred← citeshttps://doi.org/10.1145/2629565openalex-snapshot
A Cookbook for Temporal Conceptual Data Modelling with Description Logics
inferred← citeshttps://doi.org/10.1145/77600.77617openalex-snapshot
Nonclausal deduction in first-order temporal logic
inferred← citeshttps://doi.org/10.1609/aimag.v11i4.877openalex-snapshot
A bibliography on hybrid reasoning
inferred← citeshttps://doi.org/10.3233/fi-1995-2444openalex-snapshot
ON THE SATISFIABILITY PROBLEM FOR LAMPORT'S PROPOSITIONAL TEMPORAL LOGIC OF ACTIONS AND SOME OF ITS EXTENSIONS
inferred← citeshttps://doi.org/10.4230/dagsemproc.07401.4openalex-snapshot
From Non-Disjoint Combination to Satisfiability and Model-Checking of Infinite State Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1306.5088openalex-snapshot
The Complexity of Clausal Fragments of LTL
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.