Counting of Teams in First-Order Team Logics
From MaRDI portal
Publication:5092378
DOI10.4230/LIPIcs.MFCS.2019.19OpenAlexW2962733163MaRDI QIDQ5092378
No author found.
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1902.00246
Related Items
Enumerating teams in first-order team logics ⋮ Descriptive complexity of \#P functions: a new perspective
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A logical approach to context-specific independence
- Dependence logic with a majority quantifier
- A double team semantics for generalized quantifiers
- The complexity of computing the permanent
- Extensions of MSO and the monadic counting hierarchy
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- On definability in dependence logic
- An approximation trichotomy for Boolean \#CSP
- Descriptive complexity of \(\#\)P functions
- Dependence and independence
- Facets of distribution identities in probabilistic team semantics
- Logics for first-order team properties
- A finite axiomatization of conditional independence and inclusion dependencies
- $$\#\exists $$ SAT: Projected Model Counting
- QUANTUM TEAM LOGIC AND BELL’S INEQUALITIES
- Relational queries computable in polynomial time
- The Complexity of Enumeration and Reliability Problems
- Decidability of predicate logics with team semantics
- Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth
- Weighted model counting beyond two-variable logic
- Dependency as Question Entailment
- Dependence and Independence in Social Choice: Arrow’s Theorem
- A logical characterization of the counting hierarchy
- Descriptive Complexity of #AC^0 Functions
- The Complexity of Counting Functions with Easy Decision Version
