Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
From MaRDI portal
Publication:645985
DOI10.1016/J.APAL.2011.08.005zbMATH Open1250.03047arXiv1106.1323OpenAlexW2034690236MaRDI QIDQ645985FDOQ645985
Authors: Pietro Galliani 
Publication date: 11 November 2011
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Abstract: We introduce some new logics of imperfect information by adding atomic formulas corresponding to inclusion and exclusion dependencies to the language of first order logic. The properties of these logics and their relationships with other logics of imperfect information are then studied. Furthermore, a game theoretic semantics for these logics is developed. As a corollary of these results, we characterize the expressive power of independence logic, thus answering an open problem posed in (Gr"adel and V"a"an"anen, 2010).
Full work available at URL: https://arxiv.org/abs/1106.1323
Recommendations
Other nonclassical logic (03B60) Logic with extra quantifiers and operators (03C80) Second- and higher-order model theory (03C85)
Cites Work
- Dependence logic. A new approach to independence friendly logic
- Compositional semantics for a language of imperfect information
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inclusion dependencies and their interaction with functional dependencies
- A normal form for relational databases that is based on domains and keys
- Title not available (Why is that?)
- On definability in dependence logic
- From IF to BI. A tale of dependence and separation
- On a generalization of quantifiers
- Title not available (Why is that?)
- Hierarchies in Dependence Logic
- Title not available (Why is that?)
- Team logic
- Team Logic and Second-Order Logic
- Signalling in IF games: a tricky business
- Hybrid logic meets IF modal logic
Cited In (90)
- Expressivity and Complexity of Dependence Logic
- Title not available (Why is that?)
- SOME OBSERVATIONS ABOUT GENERALIZED QUANTIFIERS IN LOGICS OF IMPERFECT INFORMATION
- The implication problem for functional dependencies and variants of marginal distribution equivalences
- Complexity of syntactical tree fragments of independence-friendly logic
- Dependence and independence
- INQUISITIVE BISIMULATION
- Parameterised complexity of model checking and satisfiability in propositional dependence logic
- Counting of Teams in First-Order Team Logics
- Games for inclusion logic and fixed-point logic
- Characterizing quantifier extensions of dependence logic
- Propositional union closed team logics
- A finite axiomatization of conditional independence and inclusion dependencies
- Separation logic and logics with team semantics
- Questions and dependency in intuitionistic logic
- Characterizing downwards closed, strongly first-order, relativizable dependencies
- A double team semantics for generalized quantifiers
- Dependence logic with a majority quantifier
- Boolean dependence logic and partially-ordered connectives
- COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES
- Model-checking games for logics of imperfect information
- Title not available (Why is that?)
- Dependency Concepts up to Equivalence.
- On the expressive power of TeamLTL and first-order team logic over hyperproperties
- Team semantics for interventionist counterfactuals: observations vs. interventions
- Axiomatizations of team logics
- Complexity of Propositional Independence and Inclusion Logic
- The expressive power of \(k\)-ary exclusion logic
- A parameterized view on the complexity of dependence logic
- Approximation and dependence via multiteam semantics
- The logic of approximate dependence
- Tractability frontier of data complexity in team semantics
- General models and entailment semantics for independence logic
- Upwards closed dependencies in team semantics
- Upwards closed dependencies in team semantics
- Dependence and Independence in Social Choice: Arrow’s Theorem
- A logical approach to context-specific independence
- A Logical Approach to Context-Specific Independence
- Logics for propositional determinacy and independence
- Enumerating teams in first-order team logics
- On elementary logics for quantitative dependencies
- On definability of team relations with \(k\)-invariant atoms
- On the Presburger fragment of logics with multiteam semantics
- Unifying hidden-variable problems from quantum mechanics by logics of dependence and independence
- Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals
- Grelling on dependence
- Safe dependency atoms and possibility operators in team semantics
- Generalized quantifiers in dependence logic
- Capturing \(k\)-ary existential second order logic with \(k\)-ary inclusion-exclusion logic
- On dependence logic
- Characterizing counterfactuals and dependencies over (generalized) causal teams
- Axiomatizing first-order consequences in independence logic
- Model checking and validity in propositional and modal inclusion logics
- Coherence in inquisitive first-order logic
- Embedding causal team languages into predicate logic
- The expressive power of modal logic with inclusion atoms
- Axiomatizing first order consequences in inclusion logic
- On strongly first-order dependencies
- Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions
- Title not available (Why is that?)
- Complexity of validity for propositional dependence logics
- On the complexity of team logic and its two-variable fragment
- Doubly strongly first order dependencies
- Team semantics for the specification and verification of hyperproperties
- On quantified propositional logics and the exponential time hierarchy
- A class of automata for the verification of infinite, resource-allocating behaviours
- Propositional team logics
- Modal inclusion logic: being lax is simpler than being strict
- Breaking the atom with Samson
- Strongly first order, domain independent dependencies: the union-closed case
- Compactness in team semantics
- Approximation logics for subclasses of probabilistic conditional independence and hierarchical dependence on incomplete data
- Canonical models and the complexity of modal team logic
- Modular SAT-based techniques for reasoning tasks in team semantics
- Dimension in team semantics
- Parameterized complexity of weighted team definability
- Title not available (Why is that?)
- The expressive power of \(k\)-ary exclusion logic
- Parameterized complexity of propositional inclusion and independence logic
- Modified numerals and split disjunction: the first-order case
- Axiomatization of implication for probabilistic independence and unary variants of marginal identity and marginal distribution equivalence
- Complexity thresholds in inclusion logic
- Characterizing relative frame definability in team semantics via the universal modality
- Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals
- Multiteam semantics for interventionist counterfactuals: probabilities and causation
- On the succinctness of atoms of dependency
- Frame theory, dependence logic and strategies
- The implication problem for functional dependencies and variants of marginal distribution equivalences
- Alternating (in)dependence-friendly logic
- Dynamic logics of imperfect information: from teams and games to transitions
This page was built for publication: Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q645985)
