On the public citation graph

Model checking and validity in propositional and modal inclusion logics

0 signed · 34 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/978-3-319-30024-5_15openalex-snapshot
Approximation and Dependence via Multiteam Semantics
inferredcites →https://doi.org/10.1007/978-3-662-03927-4openalex-snapshot
Introduction to Circuit Complexity
inferredcites →https://doi.org/10.1007/978-3-662-47709-0_11openalex-snapshot
Characterizing Frame Definability in Team Semantics via the Universal Modality
inferredcites →https://doi.org/10.1007/978-3-662-52921-8_24openalex-snapshot
Characterizing Relative Frame Definability in Team Semantics via the Universal Modality
inferredcites →https://doi.org/10.1007/s11225-013-9483-6openalex-snapshot
Complexity Results for Modal Dependence Logic
inferredcites →https://doi.org/10.1016/0022-0000(84)90075-8openalex-snapshot
Inclusion dependencies and their interaction with functional dependencies
inferredcites →https://doi.org/10.1016/j.apal.2011.08.005openalex-snapshot
Inclusion and exclusion dependencies in team semantics — On some logics of imperfect information
inferredcites →https://doi.org/10.1016/j.apal.2017.01.007openalex-snapshot
Propositional team logics
inferredcites →https://doi.org/10.1016/j.apal.2018.04.010openalex-snapshot
Axiomatizations of team logics
inferredcites →https://doi.org/10.1016/j.ic.2016.04.001openalex-snapshot
A finite axiomatization of conditional independence and inclusion dependencies
inferredcites →https://doi.org/10.1016/j.ic.2016.07.008openalex-snapshot
Complexity of validity for propositional dependence logics
inferredcites →https://doi.org/10.1016/j.jcss.2016.11.004openalex-snapshot
Inclusion dependencies and their interaction with functional dependencies in SQL
inferredcites →https://doi.org/10.1017/cbo9780511611193openalex-snapshot
Dependence Logic
inferredcites →https://doi.org/10.1017/cbo9781107050884openalex-snapshot
Modal Logic
inferredcites →https://doi.org/10.1093/jigpal/5.4.539openalex-snapshot
Compositional semantics for a language of imperfect information
inferredcites →https://doi.org/10.1093/logcom/exn102openalex-snapshot
Model-theoretic and Computational Properties of Modal Dependence Logic
inferredcites →https://doi.org/10.1093/logcom/exw019openalex-snapshot
Modal independence logic:
inferredcites →https://doi.org/10.1137/0206033openalex-snapshot
The Computational Complexity of Provability in Systems of Modal Propositional Logic
inferredcites →https://doi.org/10.1145/1008354.1008356openalex-snapshot
The monotone and planar circuit value problems are log space complete for P
inferredcites →https://doi.org/10.1145/3157054openalex-snapshot
Complexity of Propositional Logics in Team Semantic
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications
inferredcites →https://doi.org/10.1145/800125.804029openalex-snapshot
Word problems requiring exponential time(Preliminary Report)
inferredcites →https://doi.org/10.4230/lipics.csl.2017.28openalex-snapshot
Complete Problems of Propositional Logic for the Exponential Hierarchy

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-39951-1_10openalex-snapshot
Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-39784-4_17openalex-snapshot
Parameterized Complexity of Propositional Inclusion and Independence Logic
inferred← citeshttps://doi.org/10.1007/978-3-032-21540-6_1openalex-snapshot
Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
inferred← citeshttps://doi.org/10.1007/s00153-024-00957-yopenalex-snapshot
Axiomatizing modal inclusion logic and its variants
inferred← citeshttps://doi.org/10.1007/s10472-021-09730-wopenalex-snapshot
Parameterised complexity of model checking and satisfiability in propositional dependence logic
inferred← citeshttps://doi.org/10.1016/j.apal.2022.103163openalex-snapshot
Enumerating teams in first-order team logics
inferred← citeshttps://doi.org/10.1016/j.ic.2025.105299openalex-snapshot
Set semantics for asynchronous TeamLTL: Expressivity and complexity
inferred← citeshttps://doi.org/10.1017/s0960129524000033openalex-snapshot
Parameterized complexity of weighted team definability
inferred← citeshttps://doi.org/10.15488/16493openalex-snapshot
Linear-Time Temporal Logic with Team Semantics: Expressivity and Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.1904.06107openalex-snapshot
Parametrised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic
inferred← citeshttps://doi.org/10.48550/arxiv.2105.14887openalex-snapshot
Parameterised Complexity of Propositional Inclusion and Independence 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.