Sum-of-Products with Default Values: Algorithms and Complexity Results
From MaRDI portal
Publication:5076308
DOI10.1613/jair.1.12370OpenAlexW4225663447MaRDI QIDQ5076308
Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider
Publication date: 16 May 2022
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.1.12370
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tractability in constraint satisfaction problems: a survey
- Model counting for CNF formulas of bounded modular treewidth
- Fundamentals of parameterized complexity
- Constraint satisfaction with bounded treewidth revisited
- Strong computational lower bounds via parameterized complexity
- Treewidth. Computations and approximations
- Conjunctive-query containment and constraint satisfaction
- Fixed-parameter complexity in AI and nonmonotonic reasoning
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
- Constraint satisfaction with succinctly specified relations
- Bucket elimination: A unifying framework for reasoning
- Algorithms for propositional model counting
- The complexity of soft constraint satisfaction
- Unifying tree decompositions for reasoning in graphical models
- Counting truth assignments of formulas of bounded tree-width or clique-width
- Parametrized complexity theory.
- A $c^k n$ 5-Approximation Algorithm for Treewidth
- Model Counting for Formulas of Bounded Clique-Width
- Solving #SAT and MAXSAT by Dynamic Programming
- Bayesian Reasoning and Machine Learning
- Parameterized Algorithms
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: Sum-of-Products with Default Values: Algorithms and Complexity Results
