On the public citation graph

Eliminating “converse” from converse PDL

https://doi.org/10.1007/bf00173700
0 signed · 35 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/bf00379767openalex-snapshot
Graded modalities. I
inferredcites →https://doi.org/10.1007/bf01050635openalex-snapshot
A modal perspective on the computational complexity of attribute value grammar
inferredcites →https://doi.org/10.1007/bf01054038openalex-snapshot
Modal logic with names
inferredcites →https://doi.org/10.1007/bf01160018openalex-snapshot
Logic of transition systems
inferredcites →https://doi.org/10.1016/0004-3702(92)90049-4openalex-snapshot
A guide to completeness and complexity for modal logics of knowledge and belief
inferredcites →https://doi.org/10.1016/0022-0000(79)90046-1openalex-snapshot
Propositional dynamic logic of regular programs
inferredcites →https://doi.org/10.1016/0022-0000(80)90061-6openalex-snapshot
A near-optimal method for reasoning about action
inferredcites →https://doi.org/10.1016/0022-0000(82)90018-6openalex-snapshot
Deterministic propositional dynamic logic: Finite models, complexity, and completeness
inferredcites →https://doi.org/10.1016/0890-5401(91)90026-xopenalex-snapshot
An essay in combinatory dynamic logic
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50019-6openalex-snapshot
Logics of Programs
inferredcites →https://doi.org/10.1016/b978-1-4832-1452-8.50115-9openalex-snapshot
On the Complexity of Conditional Logics
inferredcites →https://doi.org/10.1016/s0019-9958(82)91258-xopenalex-snapshot
Propositional dynamic logic of looping and converse is elementarily decidable
inferredcites →https://doi.org/10.1093/logcom/4.5.811openalex-snapshot
Modal Logic, Transition Systems and Processes
inferredcites →https://doi.org/10.1093/oso/9780198537618.003.0005openalex-snapshot
Modal and Temporal Logics
inferredcites →https://doi.org/10.1109/sfcs.1979.24openalex-snapshot
Models of program logics
inferredcites →https://doi.org/10.1145/800133.804362openalex-snapshot
A practical decision method for propositional dynamic logic (Preliminary Report)

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.1999.2852openalex-snapshot
Combining Deduction and Model Checking into Tableaux and Algorithms for Converse-PDL
inferred← citeshttps://doi.org/10.1007/1-84628-271-3_7openalex-snapshot
Verification Within the KARO Agent Theory
inferred← citeshttps://doi.org/10.1007/3-540-45484-5_3openalex-snapshot
Verification within the KARO Agent Theory
inferred← citeshttps://doi.org/10.1007/3-540-48317-9_2openalex-snapshot
Logic-Based Knowledge Representation
inferred← citeshttps://doi.org/10.1007/978-3-030-29026-9_19openalex-snapshot
A Non-wellfounded, Labelled Proof System for Propositional Dynamic Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-91779-1_9openalex-snapshot
Influencing Choices by Changing Beliefs: A Logical Theory of Influence, Persuasion, and Deception
inferred← citeshttps://doi.org/10.1007/978-3-032-06085-3_13openalex-snapshot
Improved Decision Procedures for Multi-modal Tense Logic Using CEGAR-Tableaux
inferred← citeshttps://doi.org/10.1007/978-3-540-45085-6_36openalex-snapshot
A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae
inferred← citeshttps://doi.org/10.1007/978-94-011-5054-5_5openalex-snapshot
Logics for Belief Base Updating
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50025-4openalex-snapshot
Reasoning in Expressive Description Logics
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.06.005openalex-snapshot
Introspection as an action in relational models
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80007-3openalex-snapshot
4 Computational modal logic
inferred← citeshttps://doi.org/10.1093/jigpal/jzs045openalex-snapshot
Reasoning about types of action and agent capabilities
inferred← citeshttps://doi.org/10.1093/logcom/11.6.879openalex-snapshot
Reducing Modal Consequence Relations
inferred← citeshttps://doi.org/10.1145/1276920.1276921openalex-snapshot
The axiomatic translation principle for modal logic
inferred← citeshttps://doi.org/10.1201/9781315167671-37openalex-snapshot
Computational Complexity
inferred← citeshttps://doi.org/10.1613/jair.4057openalex-snapshot
Beth Definability in Expressive Description Logics
inferred← citeshttps://doi.org/10.22028/d291-26295openalex-snapshot
Incremental decision procedures for modal logics with nominals and eventualities
inferred← citeshttps://doi.org/10.5591/978-1-57735-516-8/ijcai11-188openalex-snapshot
Beth Definability in Expressive Description Logics
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.