Default logic and bounded treewidth
From MaRDI portal
Publication:5918613
DOI10.1016/j.ic.2020.104675OpenAlexW3113758696MaRDI QIDQ5918613
Johannes K. Fichte, Irina Schindler, Markus Hecher
Publication date: 14 March 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2020.104675
dynamic programmingpropositional logiclower boundstree decompositionsparameterized algorithmsReiter's default logic
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- On the parameterized complexity of non-monotonic logics
- A logic for default reasoning
- Treewidth. Computations and approximations
- Which problems have strongly exponential complexity?
- QBF as an alternative to Courcelle's theorem
- Algorithms for propositional model counting
- Paradigms for parameterized enumeration
- Answer set solving with bounded treewidth revisited
- Parametrized complexity theory.
- Subtractive reductions and complete problems for counting complexity classes
- Taming high treewidth with abstraction, nested dynamic programming, and database technology
- Strong Backdoors for Default Logic
- Counting and Enumeration Problems with Bounded Treewidth
- Complexity Results for Nonmonotonic Logics
- D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action
- A Practical Approach to Courcelle's Theorem
- Expansion-based QBF Solving on Tree Decompositions*
- Parameterized Algorithms
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Default logic and bounded treewidth
This page was built for publication: Default logic and bounded treewidth
