Enumerating teams in first-order team logics

DOI10.1016/J.APAL.2022.103163MaRDI QIDQ2172832zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Counting of Teams in First-Order Team Logics
• Logics for first-order team properties
• Axiomatizations of team logics
• Team logic and second-order logic
• Team Logic and Second-Order Logic
• Logics with multiteam semantics
• Propositional team logics
• COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES
• Decidability of predicate logics with team semantics

Cites work

• Candidate keys for relations
• Complexity of propositional logics in team semantic
• Counting of Teams in First-Order Team Logics
• Dependence and independence
• Dependence Logic
• Dependence logic. A new approach to independence friendly logic
• Efficiently enumerating minimal triangulations
• Enumerating answers to first-order queries over databases of low degree
• Enumeration complexity of poor man's propositional dependence logic
• Enumeration of the monomials of a polynomial and related complexity classes
• 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 1061261 (Why is no real title available?)
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• Model checking and validity in propositional and modal inclusion logics
• Model-checking games for logics of imperfect information
• On Acyclic Conjunctive Queries and Constant Delay Enumeration
• On definability in dependence logic
• On generating all maximal independent sets
• Parameterized complexity of weighted satisfiability problems: decision, enumeration, counting
• The Complexity of Mining Maximal Frequent Subgraphs

Cited in

(5)

• On definability of team relations with \(k\)-invariant atoms
• Counting of Teams in First-Order Team Logics
• COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES
• Modular SAT-based techniques for reasoning tasks in team semantics
• Parameterized complexity of weighted team definability

This page was built for publication: Enumerating 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 Q2172832)