Johannes Klaus Fichte

According to our database, Johannes Klaus Fichte authored at least 53 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Parallel Empirical Evaluations: Resilience despite Concurrency.

Johannes Klaus Fichte, Tobias Geibinger, Markus Hecher, Matthias Schlögel

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

The Silent (R)evolution of SAT.

Johannes Klaus Fichte, Daniel Le Berre, Markus Hecher, Stefan Szeider

Commun. ACM, June, 2023

Solving Projected Model Counting by Utilizing Treewidth and its Limits.

Johannes Klaus Fichte, Markus Hecher, Michael Morak, Patrick Thier, Stefan Woltran

Artif. Intell., 2023

Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF.

Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak

LICS, 2023

Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation.

Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Inconsistent Cores for ASP: The Perks and Perils of Non-monotonicity.

Johannes Klaus Fichte, Markus Hecher, Stefan Szeider

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Exploiting Database Management Systems and Treewidth for Counting.

Johannes Klaus Fichte, Markus Hecher, Patrick Thier, Stefan Woltran

Theory Pract. Log. Program., 2022

Default logic and bounded treewidth.

Johannes Klaus Fichte, Markus Hecher, Irina Schindler

Inf. Comput., 2022

A Quantitative Symbolic Approach to Individual Human Reasoning.

Emmanuelle Dietz, Johannes Klaus Fichte, Florim Hamiti

CoRR, 2022

Proofs for Propositional Model Counting.

Johannes Klaus Fichte, Markus Hecher, Valentin Roland

Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022

IASCAR: Incremental Answer Set Counting by Anytime Refinement.

Johannes Klaus Fichte, Sarah Alice Gaggl, Markus Hecher, Dominik Rusovac

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2022

A Practical Account into Counting Dung's Extensions by Dynamic Programming.

Ridhwan Dewoprabowo, Johannes Klaus Fichte, Piotr Jerzy Gorczyca, Markus Hecher

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2022

Plausibility Reasoning via Projected Answer Set Counting - A Hybrid Approach.

Johannes Klaus Fichte, Markus Hecher, Mohamed A. Nadeem

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Model Counting, its Relationship to Symbolic Quantitative AI, and a Glimpse into Practical Solving.

Johannes Klaus Fichte

Proceedings of the Fourth International Workshop on Systems and Algorithms for Formal Argumentation co-located with the 9th International Conference on Computational Models of Argument (COMMA 2022), 2022

ApproxASP - a Scalable Approximate Answer Set Counter.

Mohimenul Kabir, Flavio O. Everardo, Ankit K. Shukla, Markus Hecher, Johannes Klaus Fichte, Kuldeep S. Meel

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Rushing and Strolling among Answer Sets - Navigation Made Easy.

Johannes Klaus Fichte, Sarah Alice Gaggl, Dominik Rusovac

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

The Model Counting Competition 2020.

Johannes Klaus Fichte, Markus Hecher, Florim Hamiti

ACM J. Exp. Algorithmics, 2021

DynASP2.5: Dynamic Programming on Tree Decompositions in Action.

Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran

Algorithms, 2021

Decomposition-Guided Reductions for Argumentation and Treewidth.

Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization.

Johannes Klaus Fichte, Markus Hecher, Valentin Roland

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Complications for Computational Experiments from Modern Processors.

Johannes Klaus Fichte, Markus Hecher, Ciaran McCreesh, Anas Shahab

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Knowledge-Base Degrees of Inconsistency: Complexity and Counting.

Johannes Klaus Fichte, Markus Hecher, Arne Meier

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Lower Bounds for QBFs of Bounded Treewidth.

Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler

Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

Solving the Steiner Tree Problem with few Terminals.

Johannes Klaus Fichte, Markus Hecher, André Schidler

Proceedings of the 32nd IEEE International Conference on Tools with Artificial Intelligence, 2020

Towards Faster Reasoners by Using Transparent Huge Pages.

Johannes Klaus Fichte, Norbert Manthey, Julian Stecklina, André Schidler

Proceedings of the Principles and Practice of Constraint Programming, 2020

Breaking Symmetries with RootClique and LexTopSort.

Johannes Klaus Fichte, Markus Hecher, Stefan Szeider

Proceedings of the Principles and Practice of Constraint Programming, 2020

A Time Leap Challenge for SAT-Solving.

Johannes Klaus Fichte, Markus Hecher, Stefan Szeider

Proceedings of the Principles and Practice of Constraint Programming, 2020

Treewidth-Aware Quantifier Elimination and Expansion for QCSP.

Johannes Klaus Fichte, Markus Hecher, Maximilian F. I. Kieler

Proceedings of the Principles and Practice of Constraint Programming, 2020

2019

Inconsistency Proofs for ASP: The ASP - DRUPE Format.

Mario Alviano, Carmine Dodaro, Johannes Klaus Fichte, Markus Hecher, Tobias Philipp, Jakob Rath

Theory Pract. Log. Program., 2019

Proceedings of the twelfth Workshop on Answer Set Programming and Other Computing Paradigms 2019.

Jorge Fandinno, Johannes Klaus Fichte

CoRR, 2019

TE-ETH: Lower Bounds for QBFs of Bounded Treewidth.

Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler

CoRR, 2019

A multiparametric view on answer set programming.

Johannes Klaus Fichte, Martin Kronegger, Stefan Woltran

Ann. Math. Artif. Intell., 2019

Treewidth and Counting Projected Answer Sets.

Johannes Klaus Fichte, Markus Hecher

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2019

The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper).

M. Ayaz Dzulfikar, Johannes Klaus Fichte, Markus Hecher

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

An Improved GPU-Based SAT Model Counter.

Johannes Klaus Fichte, Markus Hecher, Markus Zisser

Proceedings of the Principles and Practice of Constraint Programming, 2019

Counting Complexity for Reasoning in Abstract Argumentation.

Johannes Klaus Fichte, Markus Hecher, Arne Meier

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Proceedings of the elevent Workshop on Answer Set Programming and Other Computing Paradigms 2018.

Jorge Fandinno, Johannes Klaus Fichte

CoRR, 2018

Exploiting Treewidth for Projected Model Counting and Its Limits.

Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018

Exploiting Treewidth for Counting Projected Answer Sets.

Johannes Klaus Fichte, Markus Hecher

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

Weighted Model Counting on the GPU by Exploiting Small Treewidth.

Johannes Klaus Fichte, Markus Hecher, Stefan Woltran, Markus Zisser

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

An SMT Approach to Fractional Hypertree Width.

Johannes Klaus Fichte, Markus Hecher, Neha Lodha, Stefan Szeider

Proceedings of the Principles and Practice of Constraint Programming, 2018

2017

SAT-Based Local Improvement for Finding Tree Decompositions of Small Width.

Johannes Klaus Fichte, Neha Lodha, Stefan Szeider

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

Backdoor Trees for Answer Set Programming.

Johannes Klaus Fichte, Stefan Szeider

Proceedings of the 10th Workshop on Answer Set Programming and Other Computing Paradigms co-located with the 14th International Conference on Logic Programming and Nonmonotonic Reasoning, 2017

Answer Set Solving with Bounded Treewidth Revisited.

Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2017

2016

Counting Answer Sets via Dynamic Programming.

Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran

CoRR, 2016

Strong Backdoors for Default Logic.

Johannes Klaus Fichte, Arne Meier, Irina Schindler

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

Towards an integrated health research process: A cloud-based approach.

Matthieu-P. Schapranow, Matthias Uflacker, Murat Sariyar, Sebastian C. Semler, Johannes Klaus Fichte, Dietmar Schielke, Kismet Ekinci, Thomas Zahn

Proceedings of the 2016 IEEE International Conference on Big Data (IEEE BigData 2016), 2016

2015

Dual-normal logic programs - the forgotten class.

Johannes Klaus Fichte, Miroslaw Truszczynski, Stefan Woltran

Theory Pract. Log. Program., 2015

Backdoors to Normality for Disjunctive Logic Programs.

Johannes Klaus Fichte, Stefan Szeider

ACM Trans. Comput. Log., 2015

Backdoors to tractable answer set programming.

Johannes Klaus Fichte, Stefan Szeider

Artif. Intell., 2015

2013

Backdoors to the Tractability of Answer Set Programming.

Johannes Klaus Fichte

Theory Pract. Log. Program., 2013

2011

Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution.

Albert Atserias, Johannes Klaus Fichte, Marc Thurley

J. Artif. Intell. Res., 2011

The Good, the Bad, and the Odd: Cycles in Answer-Set Programs.

Johannes Klaus Fichte

Proceedings of the New Directions in Logic, Language and Computation, 2011