On the public citation graph
Possibilistic Computation Tree Logic: Decidability and Complete Axiomatization
0 signed · 26 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.1007/3-540-55460-2_36openalex-snapshot
Some considerations on the logic PFD
inferredcites →https://doi.org/10.1007/978-3-031-22337-2_18openalex-snapshot
Satisfiability of Quantitative Probabilistic CTL: Rise to the Challenge
inferredcites →https://doi.org/10.1007/978-3-642-23963-2_18openalex-snapshot
A Branching Time Logic with Two Types of Probability Operators
inferredcites →https://doi.org/10.1016/0022-0000(85)90001-7openalex-snapshot
Decision procedures and expressiveness in the temporal logic of branching time
inferredcites →https://doi.org/10.1016/0165-0114(78)90029-5openalex-snapshot
Fuzzy sets as a basis for a theory of possibility
inferredcites →https://doi.org/10.1016/j.apal.2023.103389openalex-snapshot
Probabilistic temporal logic with countably additive semantics
inferredcites →https://doi.org/10.1016/j.artint.2024.104236openalex-snapshot
Gödel–Dummett linear temporal logic
inferredcites →https://doi.org/10.1016/j.fss.2014.03.009openalex-snapshot
Computation tree logic model checking based on possibility measures
inferredcites →https://doi.org/10.1016/j.ins.2016.10.030openalex-snapshot
Model checking of linear-time properties in multi-valued systems
inferredcites →https://doi.org/10.1016/j.jcss.2023.103478openalex-snapshot
The satisfiability problem for a quantitative fragment of PCTL
inferredcites →https://doi.org/10.1016/s0019-9958(86)80001-8openalex-snapshot
Probabilistic propositional temporal logics
inferredcites →https://doi.org/10.1017/cbo9781139236119openalex-snapshot
Temporal Logics in Computer Science
inferredcites →https://doi.org/10.1017/jsl.2022.32openalex-snapshot
UNDECIDABILITY AND NON-AXIOMATIZABILITY OF MODAL MANY-VALUED LOGICS
inferredcites →https://doi.org/10.1023/a:1016740830286openalex-snapshot
Possibility Theory, Probability Theory and Multiple-Valued Logics: A Clarification
inferredcites →https://doi.org/10.1073/pnas.2309905121openalex-snapshot
Foundations of reasoning with uncertainty via real-valued logics
inferredcites →https://doi.org/10.1093/jigpal/8.1.55openalex-snapshot
Propositional temporal logics: decidability and completeness
inferredcites →https://doi.org/10.1093/logcom/exi077openalex-snapshot
Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity
inferredcites →https://doi.org/10.1109/tfuzz.2012.2232298openalex-snapshot
Model Checking of Linear-Time Properties Based on Possibility Measure
inferredcites →https://doi.org/10.1109/tfuzz.2015.2396537openalex-snapshot
Quantitative Computation Tree Logic Model Checking Based on Generalized Possibility Measures
inferredcites →https://doi.org/10.1109/tfuzz.2020.2988848openalex-snapshot
Possibilistic Fuzzy Linear Temporal Logic and Its Model Checking
inferredcites →https://doi.org/10.1109/tfuzz.2023.3260446openalex-snapshot
Model Checking of Possibilistic Linear-Time Properties Based on Generalized Possibilistic Decision Processes
inferredcites →https://doi.org/10.1109/tsmc.2023.3286127openalex-snapshot
Optimal Strategy Model Checking in Possibilistic Decision Processes
inferredcites →https://doi.org/10.1145/3582498openalex-snapshot
Reasoning about Quality and Fuzziness of Strategic Behaviors
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications
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.