Enumerating teams in first-order team logics

DOI10.1016/j.apal.2022.103163OpenAlexW4287758503MaRDI QIDQ2172832

Yanyan Li

Publication date: 16 September 2022

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.06953

zbMATH Keywords

enumeration problempolynomial delayteam-based logics

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Model-checking games for logics of imperfect information
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• On definability in dependence logic
• On generating all maximal independent sets
• Candidate keys for relations
• Enumeration complexity of poor man's propositional dependence logic
• Dependence and independence
• Efficiently enumerating minimal triangulations
• A complexity theory for hard enumeration problems
• Dependence Logic
• Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting
• Enumeration of the Monomials of a Polynomial and Related Complexity Classes
• On Acyclic Conjunctive Queries and Constant Delay Enumeration
• Complexity of Propositional Logics in Team Semantic
• The Complexity of Mining Maximal Frequent Subgraphs
• Counting of Teams in First-Order Team Logics
• Model checking and validity in propositional and modal inclusion logics

This page was built for publication: Enumerating teams in first-order team logics