Counting of Teams in First-Order Team Logics
From MaRDI portal
Recommendations
Cites work
- \(\#{\exists}\mathrm{SAT}\): projected model counting
- A double team semantics for generalized quantifiers
- A finite axiomatization of conditional independence and inclusion dependencies
- A logical approach to context-specific independence
- A logical characterization of the counting hierarchy
- An approximation trichotomy for Boolean \#CSP
- Decidability of predicate logics with team semantics
- Dependence and independence
- Dependence and Independence in Social Choice: Arrow’s Theorem
- Dependence logic with a majority quantifier
- Dependence logic. A new approach to independence friendly logic
- Dependency as question entailment
- Descriptive complexity for counting complexity classes
- Descriptive complexity of \#AC\(^0\) functions
- Descriptive complexity of \(\#\)P functions
- Extensions of MSO and the monadic counting hierarchy
- Facets of distribution identities in probabilistic team semantics
- scientific article; zbMATH DE number 6680142 (Why is no real title available?)
- scientific article; zbMATH DE number 3474957 (Why is no real title available?)
- scientific article; zbMATH DE number 1343480 (Why is no real title available?)
- scientific article; zbMATH DE number 1161568 (Why is no real title available?)
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- Logics for first-order team properties
- Model-theoretic characterization of Boolean and arithmetic circuit classes of small depth
- On definability in dependence logic
- Quantum team logic and Bell's inequalities
- Relational queries computable in polynomial time
- The complexity of computing the permanent
- The Complexity of Counting Functions with Easy Decision Version
- The Complexity of Enumeration and Reliability Problems
- Tractability frontier of data complexity in team semantics
- Weighted model counting beyond two-variable logic
Cited in
(6)- On definability of team relations with \(k\)-invariant atoms
- Enumerating teams in first-order team logics
- Descriptive complexity of \#P functions: a new perspective
- Modular SAT-based techniques for reasoning tasks in team semantics
- Parameterized complexity of weighted team definability
- Parameterised counting in logspace
This page was built for publication: Counting of Teams in First-Order Team Logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092378)
