Johannes Klaus Fichte

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 71

Top Topics

Bounded Treewidth

Tree Decompositions

Computing Paradigm

Top Venues

Publications

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