Exploiting Database Management Systems and Treewidth for Counting
From MaRDI portal
Publication:6063876
DOI10.1017/s147106842100003xzbMath1530.68067arXiv2001.04191MaRDI QIDQ6063876
Patrick Thier, Johannes K. Fichte, Markus Hecher, Stefan Woltran
Publication date: 12 December 2023
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.04191
SQLdynamic programmingcountingrelational algebrabounded treewidthparameterized algorithmicsdatabase systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Structural tractability of counting of solutions to conjunctive queries
- Treewidth. Computations and approximations
- Exploiting treewidth for projected model counting and its limits
- Bucket elimination: A unifying framework for reasoning
- Practical access to dynamic programming on tree decompositions
- Algorithms for propositional model counting
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- Taming high treewidth with abstraction, nested dynamic programming, and database technology
- On the hardness of approximate reasoning
- Graph Theory
- PP is as Hard as the Polynomial-Time Hierarchy
- Laissez-Faire Caching for Parallel #SAT Solving
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- Some (in)translatability results for normal logic programs and propositional theories
- D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy
- Answer Set Programming Modulo Acyclicity*
- Lower Bounds for QBFs of Bounded Treewidth
- Expansion-based QBF Solving on Tree Decompositions*
- Evaluation of an MSO-Solver
- Implementing Efficient All Solutions SAT Solvers
- Parameterized Algorithms
- A relational model of data for large shared data banks
- The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper)
- Default logic and bounded treewidth
This page was built for publication: Exploiting Database Management Systems and Treewidth for Counting
