Johannes K. Fichte

From MaRDI portal
Person:1647689

Available identifiers

zbMath Open fichte.johannes-klausMaRDI QIDQ1647689

List of research outcomes





PublicationDate of PublicationType
IASCAR: incremental answer set counting by anytime refinement2025-01-03Paper
Strong backdoors for default logic2024-09-25Paper
Proofs for propositional model counting2024-07-12Paper
Strong backdoors for default logic2024-07-10Paper
Exploiting Database Management Systems and Treewidth for Counting2023-12-12Paper
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF2023-04-26Paper
IASCAR: incremental answer set counting by anytime refinement2023-04-04Paper
A practical account into counting Dung's extensions by dynamic programming2023-04-04Paper
The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper)2023-02-03Paper
Solving projected model counting by utilizing treewidth and its limits2023-01-04Paper
Default logic and bounded treewidth2022-03-14Paper
https://portal.mardi4nfdi.de/entity/Q50095872021-08-04Paper
Lower Bounds for QBFs of Bounded Treewidth2021-01-21Paper
DynASP2.5: Dynamic Programming on Tree Decompositions in Action2020-05-27Paper
Inconsistency Proofs for ASP: The ASP - DRUPE Format2020-05-04Paper
Treewidth and counting projected answer sets2019-10-10Paper
A multiparametric view on answer set programming2019-08-13Paper
Exploiting treewidth for projected model counting and its limits2018-08-10Paper
Default logic and bounded treewidth2018-06-26Paper
SAT-based local improvement for finding tree decompositions of small width2017-11-15Paper
Dual-normal logic programs – the forgotten class2017-11-09Paper
Answer set solving with bounded treewidth revisited2017-09-05Paper
Backdoors to Normality for Disjunctive Logic Programs2017-07-12Paper
Strong Backdoors for Default Logic2016-09-05Paper
Backdoors to tractable answer set programming2015-05-06Paper
The Good, the Bad, and the Odd: Cycles in Answer-Set Programs2012-11-06Paper
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution2011-03-08Paper
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution2009-07-07Paper

Research outcomes over time

This page was built for person: Johannes K. Fichte