On the public citation graph
Hierarchies in independence and inclusion logic with strict semantics
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.
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.1002/net.3230200504openalex-snapshot
Identifying independence in bayesian networks
inferredcites →https://doi.org/10.1007/978-3-642-15205-4_32openalex-snapshot
Complexity Results for Modal Dependence Logic
inferredcites →https://doi.org/10.1007/s11225-013-9475-6openalex-snapshot
Lottery Semantics: A Compositional Semantics for Probabilistic First-Order Logic with Imperfect Information
inferredcites →https://doi.org/10.1007/s11225-013-9476-5openalex-snapshot
Expressing Second-order Sentences in Intuitionistic Dependence Logic
inferredcites →https://doi.org/10.1007/s11225-013-9478-3openalex-snapshot
Epistemic Operators in Dependence Logic
inferredcites →https://doi.org/10.1007/s11225-013-9479-2openalex-snapshot
Dependence and Independence
inferredcites →https://doi.org/10.1007/s11225-013-9481-8openalex-snapshot
Coherence and Computational Complexity of Quantifier-free Dependence Logic Formulas
inferredcites →https://doi.org/10.1016/0890-5401(91)90077-fopenalex-snapshot
Axioms and algorithms for inferences involving probabilistic independence
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.jcss.2003.09.002openalex-snapshot
Graph properties checkable in linear time in the number of vertices
inferredcites →https://doi.org/10.1016/j.tcs.2012.10.033openalex-snapshot
Model-checking games for logics of imperfect information
inferredcites →https://doi.org/10.1093/jigpal/jzn030openalex-snapshot
Equivalence and quantifier rules for logic with 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/exs027openalex-snapshot
The recursive path and polynomial ordering for first-order and higher-order terms
inferredcites →https://doi.org/10.1109/lics.2011.14openalex-snapshot
Complexity of Two-Variable Dependence Logic and IF-Logic
inferredcites →https://doi.org/10.1111/j.2517-6161.1979.tb01052.xopenalex-snapshot
Conditional Independence in Statistical Theory
inferredcites →https://doi.org/10.1145/2362355.2362359openalex-snapshot
Hierarchies in Dependence Logic
inferredcites →https://doi.org/10.1145/800152.804913openalex-snapshot
A hierarchy for nondeterministic time complexity
inferredcites →https://doi.org/10.4230/lipics.csl.2013.281openalex-snapshot
Inclusion Logic and Fixed Point Logic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.201900031openalex-snapshot
Axiomatizing first order consequences in inclusion logic
inferred← citeshttps://doi.org/10.1007/978-3-319-30024-5_15openalex-snapshot
Approximation and Dependence via Multiteam Semantics
inferred← citeshttps://doi.org/10.1007/978-3-319-31803-5_2openalex-snapshot
Expressivity and Complexity of Dependence Logic
inferred← citeshttps://doi.org/10.1007/978-3-662-45824-2_7openalex-snapshot
Hierarchies in Inclusion Logic with Lax Semantics
inferred← citeshttps://doi.org/10.1007/978-3-662-52921-8_23openalex-snapshot
The Expressive Power of k-ary Exclusion Logic
inferred← citeshttps://doi.org/10.1016/j.apal.2017.10.005openalex-snapshot
Capturing k-ary existential second order logic with k-ary inclusion–exclusion logic
inferred← citeshttps://doi.org/10.1016/j.apal.2022.103102openalex-snapshot
Propositional union closed team logics
inferred← citeshttps://doi.org/10.1016/j.apal.2022.103136openalex-snapshot
On definability of team relations with k-invariant atoms
inferred← citeshttps://doi.org/10.1093/logcom/exac070openalex-snapshot
A parameterized view on the complexity of dependence and independence logic
inferred← citeshttps://doi.org/10.1145/3204521openalex-snapshot
Hierarchies in Inclusion Logic with Lax Semantics
inferred← citeshttps://doi.org/10.1145/3471618openalex-snapshot
Tractability Frontier of Data Complexity in Team Semantics
inferred← citeshttps://doi.org/10.23638/lmcs-15(2:2)2019openalex-snapshot
Canonical Models and the Complexity of Modal Team Logic
inferred← citeshttps://doi.org/10.4204/eptcs.193.6openalex-snapshot
Tractability Frontier of Data Complexity in Team Semantics
inferred← citeshttps://doi.org/10.48550/arxiv.2008.10324openalex-snapshot
Propositional union closed team 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.