Enumeration complexity of poor man's propositional dependence logic

DOI10.1007/978-3-319-90050-6_17MaRDI QIDQ1647499zbMATH OpenOpenAlexWikidataFDO

Authors Arne Meier, Christian Reinbold

Publication date 26 June 2018

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05) Database theory (68P15) Logic in computer science (03B70)

Recommendations

• Enumeration complexity of conjunctive queries with functional dependencies
• Enumeration complexity of conjunctive queries with functional dependencies
• Enumeration complexity of logical query problems with second-order variables
• Complexity Results for Modal Dependence Logic
• Complexity results for modal dependence logic

Cited in

(6)

• Parameterised complexity of model checking and satisfiability in propositional dependence logic
• Modular SAT-based techniques for reasoning tasks in team semantics
• A parameterized view on the complexity of dependence logic
• Parameterized complexity of weighted team definability
• Parameterized complexity of propositional inclusion and independence logic
• Enumerating teams in first-order team logics

This page was built for publication: Enumeration complexity of poor man's propositional dependence logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1647499)