Johannes K. Fichte
Johannes K. Fichte
PostDoc, TU Dresden
Verified email at tu-dresden.de - Homepage
Title
Cited by
Cited by
Year
Clause-learning algorithms with many restarts and bounded-width resolution
A Atserias, J Fichte, M Thurley
Journal of Artificial Intelligence Research (JAIR) 40, 353-373, 2011
1132011
Backdoors to tractable answer set programming
JK Fichte, S Szeider
Artificial Intelligence 220, 64-103, 2015
45*2015
Answer set solving with bounded treewidth revisited
JK Fichte, M Hecher, M Morak, S Woltran
International Conference on Logic Programming and Nonmonotonic Reasoning …, 2017
40*2017
Backdoors to Normality for Disjunctive Logic Programs.
JK Fichte, S Szeider
ACM Transactions on Computational Logic (TOCL) 17 (1), 7:1--7:23, 2015
382015
Exploiting Treewidth for Projected Model Counting and Its Limits
JK Fichte, M Hecher, M Morak, S Woltran
International Conference on Theory and Applications of Satisfiability …, 2018
242018
An SMT Approach to Fractional Hypertree Width
JK Fichte, M Hecher, N Lodha, S Szeider
International Conference on Principles and Practice of Constraint …, 2018
212018
The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration
MA Dzulfikar, JK Fichte, M Hecher
14th International Symposium on Parameterized and Exact Computation (IPEC 2019), 2019
192019
Exploiting treewidth for counting projected answer sets
JK Fichte, M Hecher
Proceedings of the 16th International Conference on Principles of Knowledge …, 2018
17*2018
Counting complexity for reasoning in abstract argumentation
JK Fichte, M Hecher, A Meier
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 2827-2834, 2019
162019
Weighted model counting on the GPU by exploiting small treewidth
JK Fichte, M Hecher, S Woltran, M Zisser
26th Annual European Symposium on Algorithms (ESA 2018), 2018
162018
SAT-Based Local Improvement for Finding Tree Decompositions of Small Width
JK Fichte, N Lodha, S Szeider
International Conference on Theory and Applications of Satisfiability …, 2017
162017
An Improved GPU-Based SAT Model Counter
JK Fichte, M Hecher, M Zisser
International Conference on Principles and Practice of Constraint …, 2019
13*2019
DynASP2.5: Dynamic Programming on Tree Decompositions in Action
JK Fichte, M Hecher, M Morak, S Woltran
12th International Symposium on Parameterized and Exact Computation (IPEC …, 2018
13*2018
Default logic and bounded Treewidth
JK Fichte, M Hecher, I Schindler
Information and Computation, 104675, 2020
112020
Exploiting Database Management Systems and Treewidth for Counting
JK Fichte, M Hecher, P Thier, S Woltran
Practical Aspects of Declarative Languages, 151, 2020
102020
A Time Leap Challenge for SAT-Solving
JK Fichte, M Hecher, S Szeider
International Conference on Principles and Practice of Constraint …, 2020
82020
Lower Bounds for QBFs of Bounded Treewidth
JK Fichte, M Hecher, A Pfandler
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer …, 2020
8*2020
A multiparametric view on answer set programming
JK Fichte, M Kronegger, S Woltran
Annals of Mathematics and Artificial Intelligence 86 (1-3), 121-147, 2019
82019
Dual-normal logic programs–the forgotten class
JK Fichte, M Truszczyński, S Woltran
Theory and Practice of Logic Programming 15 (4-5), 495-510, 2015
72015
The good, the bad, and the odd: Cycles in answer-set programs
JK Fichte
Proceedings of the 23th European Summer School in Logic, Language and …, 2012
72012
The system can't perform the operation now. Try again later.
Articles 1–20