Johannes Klaus Fichte

104 papers A* 21A 16B 9C 2Journal 51Unranked 5
YearRankTypeTitle / Venue / Authors
2026 A* conf
Structure-Aware Encodings of Argumentation Properties for Clique-width.
AAAI
Yasir Mahmood, Markus Hecher, Johanna Groven, Johannes Klaus Fichte
2025 J jnl
Complexity of Faceted Explanations in Propositional Abduction.
CoRR
Johannes Schmidt, Mohamed Maizia, Victor Lagerkvist, Johannes Klaus Fichte
2025 J jnl
Complexity of Faceted Explanations in Propositional Abduction.
Theory Pract. Log. Program.
Johannes Schmidt, Mohamed Maizia, Victor Lagerkvist, Johannes Klaus Fichte
2025 A* conf
Counting and Reasoning with Plans.
AAAI
David Speck, Markus Hecher, Daniel Gnad, Johannes Klaus Fichte, Augusto B. Corrêa
2025 J jnl
Counting and Reasoning with Plans.
CoRR
David Speck, Markus Hecher, Daniel Gnad, Johannes Klaus Fichte, Augusto B. Corrêa
2025 J jnl
Epistemic Logic Programs: Non-Ground and Counting Complexity.
CoRR
Thomas Eiter, Johannes Klaus Fichte, Markus Hecher, Stefan Woltran
2025 A* conf
Facets in Argumentation: A Formal Approach to Argument Significance.
IJCAI
Johannes Klaus Fichte, Nicolas Fröhlich, Markus Hecher, Victor Lagerkvist, Yasir Mahmood, Arne Meier, Jonathan Persson
2025 J jnl
Facets in Argumentation: A Formal Approach to Argument Significance.
CoRR
Johannes Klaus Fichte, Nicolas Fröhlich, Markus Hecher, Victor Lagerkvist, Yasir Mahmood, Arne Meier, Jonathan Persson
2025 A* conf
Interactive Exploration of Plan Spaces.
KR
Daniel Gnad, Markus Hecher, Sarah Alice Gaggl, Dominik Rusovac, David Speck, Johannes Klaus Fichte
2025 J jnl
Structure-Aware Encodings of Argumentation Properties for Clique-width.
CoRR
Yasir Mahmood, Markus Hecher, Johanna Groven, Johannes Klaus Fichte
2025 J jnl
The Model Counting Competitions 2021-2023.
CoRR
Johannes Klaus Fichte, Markus Hecher
2024 J jnl
Counting Complexity for Reasoning in Abstract Argumentation.
J. Artif. Intell. Res.
Johannes Klaus Fichte, Markus Hecher, Arne Meier
2024 A* conf
Epistemic Logic Programs: Non-Ground and Counting Complexity.
IJCAI
Thomas Eiter, Johannes Klaus Fichte, Markus Hecher, Stefan Woltran
2024 B conf
Forgetting in Counting and Bounded Treewidth.
ICTAI
Johannes Klaus Fichte, Markus Hecher
2024 J jnl
IASCAR: Incremental Answer Set Counting by Anytime Refinement.
Theory Pract. Log. Program.
Johannes Klaus Fichte, Sarah Alice Gaggl, Markus Hecher, Dominik Rusovac
2024 A* conf
Navigating and Querying Answer Sets: How Hard Is It Really and Why?
KR
Dominik Rusovac, Markus Hecher, Martin Gebser, Sarah Alice Gaggl, Johannes Klaus Fichte
2024 A* conf
Parallel Empirical Evaluations: Resilience despite Concurrency.
AAAI
Johannes Klaus Fichte, Tobias Geibinger, Markus Hecher, Matthias Schlögel
2024 A conf
Rejection in Abstract Argumentation: Harder Than Acceptance?
ECAI
Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier
2024 J jnl
Rejection in Abstract Argumentation: Harder Than Acceptance?
CoRR
Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier
2024 J jnl
Strong Backdoors for Default Logic.
ACM Trans. Comput. Log.
Johannes Klaus Fichte, Arne Meier, Irena Schindler
2024 A conf
The Relative Strength of #SAT Proof Systems.
SAT
Olaf Beyersdorff, Johannes Klaus Fichte, Markus Hecher, Tim Hoffmann, Kaspar Kasche
2023 J jnl
IASCAR: Incremental Answer Set Counting by Anytime Refinement.
CoRR
Johannes Klaus Fichte, Sarah Alice Gaggl, Markus Hecher, Dominik Rusovac
2023 A* conf
Inconsistent Cores for ASP: The Perks and Perils of Non-monotonicity.
AAAI
Johannes Klaus Fichte, Markus Hecher, Stefan Szeider
2023 A* conf
Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation.
IJCAI
Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier
2023 J jnl
Solving Projected Model Counting by Utilizing Treewidth and its Limits.
Artif. Intell.
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Patrick Thier, Stefan Woltran
2023 J jnl
Solving Projected Model Counting by Utilizing Treewidth and its Limits.
CoRR
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Patrick Thier, Stefan Woltran
2023 A* conf
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF.
LICS
Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak
2023 J jnl
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF.
CoRR
Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak
2023 J jnl
The Silent (R)evolution of SAT.
Commun. ACM
Johannes Klaus Fichte, Daniel Le Berre, Markus Hecher, Stefan Szeider
2022 B conf
A Practical Account into Counting Dung's Extensions by Dynamic Programming.
LPNMR
Ridhwan Dewoprabowo, Johannes Klaus Fichte, Piotr Jerzy Gorczyca, Markus Hecher
2022 B conf
A Quantitative Symbolic Approach to Individual Human Reasoning.
CogSci
Emmanuelle Dietz, Johannes Klaus Fichte, Florim Hamiti
2022 J jnl
A Quantitative Symbolic Approach to Individual Human Reasoning.
CoRR
Emmanuelle Dietz, Johannes Klaus Fichte, Florim Hamiti
2022 A* conf
ApproxASP - a Scalable Approximate Answer Set Counter.
AAAI
Mohimenul Kabir, Flavio O. Everardo, Ankit K. Shukla, Markus Hecher, Johannes Klaus Fichte, Kuldeep S. Meel
2022 J jnl
Default logic and bounded treewidth.
Inf. Comput.
Johannes Klaus Fichte, Markus Hecher, Irina Schindler
2022 J jnl
Exploiting Database Management Systems and Treewidth for Counting.
Theory Pract. Log. Program.
Johannes Klaus Fichte, Markus Hecher, Patrick Thier, Stefan Woltran
2022 B conf
IASCAR: Incremental Answer Set Counting by Anytime Refinement.
LPNMR
Johannes Klaus Fichte, Sarah Alice Gaggl, Markus Hecher, Dominik Rusovac
2022 — conf
Model Counting, its Relationship to Symbolic Quantitative AI, and a Glimpse into Practical Solving.
SAFA
Johannes Klaus Fichte
2022 A* conf
Plausibility Reasoning via Projected Answer Set Counting - A Hybrid Approach.
IJCAI
Johannes Klaus Fichte, Markus Hecher, Mohamed A. Nadeem
2022 A conf
Proofs for Propositional Model Counting.
SAT
Johannes Klaus Fichte, Markus Hecher, Valentin Roland
2022 A* conf
Rushing and Strolling among Answer Sets - Navigation Made Easy.
AAAI
Johannes Klaus Fichte, Sarah Alice Gaggl, Dominik Rusovac
2021 A conf
Complications for Computational Experiments from Modern Processors.
CP
Johannes Klaus Fichte, Markus Hecher, Ciaran McCreesh, Anas Shahab
2021 A* conf
Decomposition-Guided Reductions for Argumentation and Treewidth.
IJCAI
Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier
2021 J jnl
DynASP2.5: Dynamic Programming on Tree Decompositions in Action.
Algorithms
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran
2021 A* conf
Knowledge-Base Degrees of Inconsistency: Complexity and Counting.
AAAI
Johannes Klaus Fichte, Markus Hecher, Arne Meier
2021 A conf
Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization.
CP
Johannes Klaus Fichte, Markus Hecher, Valentin Roland
2021 J jnl
Rushing and Strolling among Answer Sets - Navigation Made Easy.
CoRR
Johannes Klaus Fichte, Sarah Alice Gaggl, Dominik Rusovac
2021 J jnl
The Model Counting Competition 2020.
ACM J. Exp. Algorithmics
Johannes Klaus Fichte, Markus Hecher, Florim Hamiti
2020 J jnl
A Time Leap Challenge for SAT Solving.
CoRR
Johannes Klaus Fichte, Markus Hecher, Stefan Szeider
2020 A conf
A Time Leap Challenge for SAT-Solving.
CP
Johannes Klaus Fichte, Markus Hecher, Stefan Szeider
2020 A conf
Breaking Symmetries with RootClique and LexTopSort.
CP
Johannes Klaus Fichte, Markus Hecher, Stefan Szeider
2020 C conf
Exploiting Database Management Systems and Treewidth for Counting.
PADL
Johannes Klaus Fichte, Markus Hecher, Patrick Thier, Stefan Woltran
2020 J jnl
Exploiting Database Management Systems and Treewidth for Counting.
CoRR
Johannes Klaus Fichte, Markus Hecher, Patrick Thier, Stefan Woltran
2020 A* conf
Lower Bounds for QBFs of Bounded Treewidth.
LICS
Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler
2020 B conf
Solving the Steiner Tree Problem with few Terminals.
ICTAI
Johannes Klaus Fichte, Markus Hecher, André Schidler
2020 J jnl
Solving the Steiner Tree Problem with few Terminals.
CoRR
Johannes Klaus Fichte, Markus Hecher, André Schidler
2020 J jnl
The Model Counting Competition 2020.
CoRR
Johannes Klaus Fichte, Markus Hecher, Florim Hamiti
2020 J jnl
Towards Faster Reasoners By Using Transparent Huge Pages.
CoRR
Johannes Klaus Fichte, Norbert Manthey, Julian Stecklina, André Schidler
2020 A conf
Towards Faster Reasoners by Using Transparent Huge Pages.
CP
Johannes Klaus Fichte, Norbert Manthey, Julian Stecklina, André Schidler
2020 A conf
Treewidth-Aware Quantifier Elimination and Expansion for QCSP.
CP
Johannes Klaus Fichte, Markus Hecher, Maximilian F. I. Kieler
2019 J jnl
A multiparametric view on answer set programming.
Ann. Math. Artif. Intell.
Johannes Klaus Fichte, Martin Kronegger, Stefan Woltran
2019 A conf
An Improved GPU-Based SAT Model Counter.
CP
Johannes Klaus Fichte, Markus Hecher, Markus Zisser
2019 A* conf
Counting Complexity for Reasoning in Abstract Argumentation.
AAAI
Johannes Klaus Fichte, Markus Hecher, Arne Meier
2019 J jnl
Inconsistency Proofs for ASP: The ASP - DRUPE Format.
Theory Pract. Log. Program.
Mario Alviano, Carmine Dodaro, Johannes Klaus Fichte, Markus Hecher, Tobias Philipp, Jakob Rath
2019 J jnl
Inconsistency Proofs for ASP: The ASP-DRUPE Format.
CoRR
Mario Alviano, Carmine Dodaro, Johannes Klaus Fichte, Markus Hecher, Tobias Philipp, Jakob Rath
2019 J jnl
Proceedings of the twelfth Workshop on Answer Set Programming and Other Computing Paradigms 2019.
CoRR
Jorge Fandinno, Johannes Klaus Fichte
2019 J jnl
TE-ETH: Lower Bounds for QBFs of Bounded Treewidth.
CoRR
Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler
2019 B conf
The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper).
IPEC
Muhammad Ayaz Dzulfikar, Johannes Klaus Fichte, Markus Hecher
2019 B conf
Treewidth and Counting Projected Answer Sets.
LPNMR
Johannes Klaus Fichte, Markus Hecher
2019 J jnl
Treewidth and Counting Projected Answer Sets.
CoRR
Johannes Klaus Fichte, Markus Hecher
2018 A conf
An SMT Approach to Fractional Hypertree Width.
CP
Johannes Klaus Fichte, Markus Hecher, Neha Lodha, Stefan Szeider
2018 J jnl
Counting Complexity for Reasoning in Abstract Argumentation.
CoRR
Johannes Klaus Fichte, Markus Hecher, Arne Meier
2018 C conf
Default Logic and Bounded Treewidth.
LATA
Johannes Klaus Fichte, Markus Hecher, Irina Schindler
2018 A* conf
Exploiting Treewidth for Counting Projected Answer Sets.
KR
Johannes Klaus Fichte, Markus Hecher
2018 A conf
Exploiting Treewidth for Projected Model Counting and Its Limits.
SAT
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran
2018 J jnl
Exploiting Treewidth for Projected Model Counting and its Limits.
CoRR
Johannes Klaus Fichte, Michael Morak, Markus Hecher, Stefan Woltran
2018 J jnl
Proceedings of the elevent Workshop on Answer Set Programming and Other Computing Paradigms 2018.
CoRR
Jorge Fandinno, Johannes Klaus Fichte
2018 A conf
Weighted Model Counting on the GPU by Exploiting Small Treewidth.
ESA
Johannes Klaus Fichte, Markus Hecher, Stefan Woltran, Markus Zisser
2017 — conf
A Multiparametric View on Answer Set Programming.
ASPOCP@LPNMR
Johannes Klaus Fichte, Martin Kronegger, Stefan Woltran
2017 B conf
Answer Set Solving with Bounded Treewidth Revisited.
LPNMR
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran
2017 J jnl
Answer Set Solving with Bounded Treewidth Revisited.
CoRR
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran
2017 — conf
Backdoor Trees for Answer Set Programming.
ASPOCP@LPNMR
Johannes Klaus Fichte, Stefan Szeider
2017 J jnl
Default Logic and Bounded Treewidth.
CoRR
Johannes Klaus Fichte, Markus Hecher, Irina Schindler
2017 B conf
DynASP2.5: Dynamic Programming on Tree Decompositions in Action.
IPEC
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran
2017 J jnl
DynASP2.5: Dynamic Programming on Tree Decompositions in Action.
CoRR
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran
2017 A conf
SAT-Based Local Improvement for Finding Tree Decompositions of Small Width.
SAT
Johannes Klaus Fichte, Neha Lodha, Stefan Szeider
2016 J jnl
Counting Answer Sets via Dynamic Programming.
CoRR
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran
2016 A conf
Strong Backdoors for Default Logic.
SAT
Johannes Klaus Fichte, Arne Meier, Irina Schindler
2016 J jnl
Strong Backdoors for Default Logic.
CoRR
Johannes Klaus Fichte, Arne Meier, Irina Schindler
2016 — conf
Towards an integrated health research process: A cloud-based approach.
IEEE BigData
Matthieu-P. Schapranow, Matthias Uflacker, Murat Sariyar, Sebastian C. Semler, Johannes Klaus Fichte, Dietmar Schielke, Kismet Ekinci, Thomas Zahn
2015 J jnl
Backdoors to Normality for Disjunctive Logic Programs.
ACM Trans. Comput. Log.
Johannes Klaus Fichte, Stefan Szeider
2015 J jnl
Backdoors to tractable answer set programming.
Artif. Intell.
Johannes Klaus Fichte, Stefan Szeider
2015 J jnl
Dual-normal Logic Programs - the Forgotten Class.
CoRR
Johannes Klaus Fichte, Miroslaw Truszczynski, Stefan Woltran
2015 J jnl
Dual-normal logic programs - the forgotten class.
Theory Pract. Log. Program.
Johannes Klaus Fichte, Miroslaw Truszczynski, Stefan Woltran
2014 J jnl
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution.
CoRR
Albert Atserias, Johannes Klaus Fichte, Marc Thurley
2013 J jnl
Backdoors to Normality for Disjunctive Logic Programs
CoRR
Johannes Klaus Fichte, Stefan Szeider
2013 A* conf
Backdoors to Normality for Disjunctive Logic Programs.
AAAI
Johannes Klaus Fichte, Stefan Szeider
2013 A* conf
Backdoors to Tractability of Answer-Set Programming.
AAAI
Johannes Klaus Fichte
2013 J jnl
Backdoors to the Tractability of Answer Set Programming.
Theory Pract. Log. Program.
Johannes Klaus Fichte
2012 J jnl
The Good, the Bad, and the Odd: Cycles in Answer-Set Programs
CoRR
Johannes Klaus Fichte
2011 J jnl
Backdoors to Tractable Answer-Set Programming
CoRR
Johannes Klaus Fichte, Stefan Szeider
2011 A* conf
Backdoors to Tractable Answer-Set Programming.
IJCAI
Johannes Klaus Fichte, Stefan Szeider
2011 J jnl
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution.
J. Artif. Intell. Res.
Albert Atserias, Johannes Klaus Fichte, Marc Thurley
2011 — conf
The Good, the Bad, and the Odd: Cycles in Answer-Set Programs.
ESSLLI Student Sessions
Johannes Klaus Fichte
2009 A conf
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution.
SAT
Albert Atserias, Johannes Klaus Fichte, Marc Thurley