Johannes Klaus Fichte
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
50
Venues
14
Active years
2009–2026
Best venue rank
A*
Where they publish
Papers
50 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | AAAI | Structure-Aware Encodings of Argumentation Properties for Clique-width. | Yasir Mahmood, Markus Hecher, Johanna Groven, Johannes Klaus Fichte |
| 2026 | KR | Counting Complexity of ASP. | Max Bannach, Johannes Klaus Fichte, Johanna Groven, Markus Hecher |
| 2025 | AAAI | Counting and Reasoning with Plans. | David Speck, Markus Hecher, Daniel Gnad, Johannes Klaus Fichte, Augusto B. Corra |
| 2025 | IJCAI | Facets in Argumentation: A Formal Approach to Argument Significance. | Johannes Klaus Fichte, Nicolas Frhlich, Markus Hecher, Victor Lagerkvist, Yasir Mahmood, Arne Meier, Jonathan Persson |
| 2025 | KR | Interactive Exploration of Plan Spaces. | Daniel Gnad, Markus Hecher, Sarah Alice Gaggl, Dominik Rusovac, David Speck, Johannes Klaus Fichte |
| 2024 | AAAI | Parallel Empirical Evaluations: Resilience despite Concurrency. | Johannes Klaus Fichte, Tobias Geibinger, Markus Hecher, Matthias Schlgel |
| 2024 | ECAI | Rejection in Abstract Argumentation: Harder Than Acceptance? | Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier |
| 2024 | IJCAI | Epistemic Logic Programs: Non-Ground and Counting Complexity. | Thomas Eiter, Johannes Klaus Fichte, Markus Hecher, Stefan Woltran |
| 2024 | ICTAI | Forgetting in Counting and Bounded Treewidth. | Johannes Klaus Fichte, Markus Hecher |
| 2024 | KR | Navigating and Querying Answer Sets: How Hard Is It Really and Why? | Dominik Rusovac, Markus Hecher, Martin Gebser, Sarah Alice Gaggl, Johannes Klaus Fichte |
| 2024 | SAT | The Relative Strength of #SAT Proof Systems. | Olaf Beyersdorff, Johannes Klaus Fichte, Markus Hecher, Tim Hoffmann, Kaspar Kasche |
| 2023 | AAAI | Inconsistent Cores for ASP: The Perks and Perils of Non-monotonicity. | Johannes Klaus Fichte, Markus Hecher, Stefan Szeider |
| 2023 | IJCAI | Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation. | Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier |
| 2023 | LICS | Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. | Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak |
| 2022 | AAAI | Rushing and Strolling among Answer Sets - Navigation Made Easy. | Johannes Klaus Fichte, Sarah Alice Gaggl, Dominik Rusovac |
| 2022 | AAAI | ApproxASP - a Scalable Approximate Answer Set Counter. | Mohimenul Kabir, Flavio O. Everardo, Ankit K. Shukla, Markus Hecher, Johannes Klaus Fichte, Kuldeep S. Meel |
| 2022 | CogSci | A Quantitative Symbolic Approach to Individual Human Reasoning. | Emmanuelle Dietz, Johannes Klaus Fichte, Florim Hamiti |
| 2022 | COMMA | Model Counting, its Relationship to Symbolic Quantitative AI, and a Glimpse into Practical Solving. | Johannes Klaus Fichte |
| 2022 | IJCAI | Plausibility Reasoning via Projected Answer Set Counting - A Hybrid Approach. | Johannes Klaus Fichte, Markus Hecher, Mohamed A. Nadeem |
| 2022 | LPNMR | A Practical Account into Counting Dung's Extensions by Dynamic Programming. | Ridhwan Dewoprabowo, Johannes Klaus Fichte, Piotr Jerzy Gorczyca, Markus Hecher |
| 2022 | LPNMR | IASCAR: Incremental Answer Set Counting by Anytime Refinement. | Johannes Klaus Fichte, Sarah Alice Gaggl, Markus Hecher, Dominik Rusovac |
| 2022 | SAT | Proofs for Propositional Model Counting. | Johannes Klaus Fichte, Markus Hecher, Valentin Roland |
| 2021 | AAAI | Knowledge-Base Degrees of Inconsistency: Complexity and Counting. | Johannes Klaus Fichte, Markus Hecher, Arne Meier |
| 2021 | CP | Complications for Computational Experiments from Modern Processors. | Johannes Klaus Fichte, Markus Hecher, Ciaran McCreesh, Anas Shahab |
| 2021 | CP | Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization. | Johannes Klaus Fichte, Markus Hecher, Valentin Roland |
| 2021 | IJCAI | Decomposition-Guided Reductions for Argumentation and Treewidth. | Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier |
| 2020 | CP | Treewidth-Aware Quantifier Elimination and Expansion for QCSP. | Johannes Klaus Fichte, Markus Hecher, Maximilian F. I. Kieler |
| 2020 | CP | A Time Leap Challenge for SAT-Solving. | Johannes Klaus Fichte, Markus Hecher, Stefan Szeider |
| 2020 | CP | Breaking Symmetries with RootClique and LexTopSort. | Johannes Klaus Fichte, Markus Hecher, Stefan Szeider |
| 2020 | CP | Towards Faster Reasoners by Using Transparent Huge Pages. | Johannes Klaus Fichte, Norbert Manthey, Julian Stecklina, Andr Schidler |
| 2020 | ICTAI | Solving the Steiner Tree Problem with few Terminals. | Johannes Klaus Fichte, Markus Hecher, Andr Schidler |
| 2020 | LICS | Lower Bounds for QBFs of Bounded Treewidth. | Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler |
| 2020 | PADL | Exploiting Database Management Systems and Treewidth for Counting. | Johannes Klaus Fichte, Markus Hecher, Patrick Thier, Stefan Woltran |
| 2019 | AAAI | Counting Complexity for Reasoning in Abstract Argumentation. | Johannes Klaus Fichte, Markus Hecher, Arne Meier |
| 2019 | CP | An Improved GPU-Based SAT Model Counter. | Johannes Klaus Fichte, Markus Hecher, Markus Zisser |
| 2019 | LPNMR | Treewidth and Counting Projected Answer Sets. | Johannes Klaus Fichte, Markus Hecher |
| 2018 | CP | An SMT Approach to Fractional Hypertree Width. | Johannes Klaus Fichte, Markus Hecher, Neha Lodha, Stefan Szeider |
| 2018 | ESA | Weighted Model Counting on the GPU by Exploiting Small Treewidth. | Johannes Klaus Fichte, Markus Hecher, Stefan Woltran, Markus Zisser |
| 2018 | KR | Exploiting Treewidth for Counting Projected Answer Sets. | Johannes Klaus Fichte, Markus Hecher |
| 2018 | LATA | Default Logic and Bounded Treewidth. | Johannes Klaus Fichte, Markus Hecher, Irina Schindler |
| 2018 | SAT | Exploiting Treewidth for Projected Model Counting and Its Limits. | Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran |
| 2017 | LPNMR | Answer Set Solving with Bounded Treewidth Revisited. | Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran |
| 2017 | LPNMR | A Multiparametric View on Answer Set Programming. | Johannes Klaus Fichte, Martin Kronegger, Stefan Woltran |
| 2017 | LPNMR | Backdoor Trees for Answer Set Programming. | Johannes Klaus Fichte, Stefan Szeider |
| 2017 | SAT | SAT-Based Local Improvement for Finding Tree Decompositions of Small Width. | Johannes Klaus Fichte, Neha Lodha, Stefan Szeider |
| 2016 | SAT | Strong Backdoors for Default Logic. | Johannes Klaus Fichte, Arne Meier, Irina Schindler |
| 2013 | AAAI | Backdoors to Tractability of Answer-Set Programming. | Johannes Klaus Fichte |
| 2013 | AAAI | Backdoors to Normality for Disjunctive Logic Programs. | Johannes Klaus Fichte, Stefan Szeider |
| 2011 | IJCAI | Backdoors to Tractable Answer-Set Programming. | Johannes Klaus Fichte, Stefan Szeider |
| 2009 | SAT | Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution. | Albert Atserias, Johannes Klaus Fichte, Marc Thurley |