Enumeration complexity of poor man's propositional dependence logic

DOI10.1007/978-3-319-90050-6_17OpenAlexW2608649399WikidataQ57998255 ScholiaQ57998255MaRDI QIDQ1647499

Christian Reinbold, Arne Meier

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) Database theory (68P15) Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Logic in computer science (03B70)

Related Items (4)

A parameterized view on the complexity of dependence logic ⋮ Enumerating teams in first-order team logics ⋮ Parameterized complexity of propositional inclusion and independence logic ⋮ Parameterised complexity of model checking and satisfiability in propositional dependence logic

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