The following pages link to Johannes K. Fichte (Q1647689):
Displaying 23 items.
- Exploiting treewidth for projected model counting and its limits (Q1656576) (← links)
- SAT-based local improvement for finding tree decompositions of small width (Q1680268) (← links)
- A multiparametric view on answer set programming (Q2317973) (← links)
- Treewidth and counting projected answer sets (Q2326718) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Answer set solving with bounded treewidth revisited (Q2401930) (← links)
- Solving projected model counting by utilizing treewidth and its limits (Q2680775) (← links)
- IASCAR: incremental answer set counting by anytime refinement (Q2694570) (← links)
- A practical account into counting Dung's extensions by dynamic programming (Q2694593) (← links)
- Strong Backdoors for Default Logic (Q2818000) (← links)
- Dual-normal logic programs – the forgotten class (Q4592993) (← links)
- (Q5009587) (← links)
- Inconsistency Proofs for ASP: The ASP - DRUPE Format (Q5108508) (← links)
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action (Q5111876) (← links)
- Lower Bounds for QBFs of Bounded Treewidth (Q5145651) (← links)
- The Good, the Bad, and the Odd: Cycles in Answer-Set Programs (Q5200464) (← links)
- Backdoors to Normality for Disjunctive Logic Programs (Q5277908) (← links)
- The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper) (Q5875560) (← links)
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution (Q5894155) (← links)
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution (Q5902141) (← links)
- Default logic and bounded treewidth (Q5915667) (← links)
- Default logic and bounded treewidth (Q5918613) (← links)
- Exploiting Database Management Systems and Treewidth for Counting (Q6063876) (← links)
