default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohannes Klaus Fichte
Person information
- affiliation: Linköping University, Sweden
- affiliation: TU Wien, Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Johannes Klaus Fichte
, Markus Hecher, Arne Meier:
Counting Complexity for Reasoning in Abstract Argumentation. J. Artif. Intell. Res. 80 (2024)- [c45]Johannes Klaus Fichte, Tobias Geibinger, Markus Hecher, Matthias Schlögel:
Parallel Empirical Evaluations: Resilience despite Concurrency. AAAI 2024: 8004-8012 - [c44]Olaf Beyersdorff, Johannes Klaus Fichte, Markus Hecher, Tim Hoffmann, Kaspar Kasche:
The Relative Strength of #SAT Proof Systems. SAT 2024: 5:1-5:19 - 2023
- [j13]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Patrick Thier, Stefan Woltran:
Solving Projected Model Counting by Utilizing Treewidth and its Limits. Artif. Intell. 314: 103810 (2023) - [j12]Johannes Klaus Fichte, Daniel Le Berre, Markus Hecher, Stefan Szeider:
The Silent (R)evolution of SAT. Commun. ACM 66(6): 64-72 (2023) - [c43]Johannes Klaus Fichte, Markus Hecher, Stefan Szeider:
Inconsistent Cores for ASP: The Perks and Perils of Non-monotonicity. AAAI 2023: 6363-6371 - [c42]Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier:
Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation. IJCAI 2023: 3212-3220 - [c41]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: 1-14 - [i27]Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak:
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. CoRR abs/2304.13896 (2023) - [i26]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Patrick Thier, Stefan Woltran:
Solving Projected Model Counting by Utilizing Treewidth and its Limits. CoRR abs/2305.19212 (2023) - [i25]Johannes Klaus Fichte, Sarah Alice Gaggl, Markus Hecher, Dominik Rusovac:
IASCAR: Incremental Answer Set Counting by Anytime Refinement. CoRR abs/2311.07233 (2023) - 2022
- [j11]Johannes Klaus Fichte, Markus Hecher, Irina Schindler:
Default logic and bounded treewidth. Inf. Comput. 283: 104675 (2022) - [j10]Johannes Klaus Fichte, Markus Hecher, Patrick Thier, Stefan Woltran:
Exploiting Database Management Systems and Treewidth for Counting. Theory Pract. Log. Program. 22(1): 128-157 (2022) - [c40]Johannes Klaus Fichte, Sarah Alice Gaggl, Dominik Rusovac:
Rushing and Strolling among Answer Sets - Navigation Made Easy. AAAI 2022: 5651-5659 - [c39]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: 5755-5764 - [c38]Emmanuelle Dietz, Johannes Klaus Fichte, Florim Hamiti:
A Quantitative Symbolic Approach to Individual Human Reasoning. CogSci 2022 - [c37]Johannes Klaus Fichte:
Model Counting, its Relationship to Symbolic Quantitative AI, and a Glimpse into Practical Solving. SAFA@COMMA 2022: 1-4 - [c36]Johannes Klaus Fichte, Markus Hecher, Mohamed A. Nadeem:
Plausibility Reasoning via Projected Answer Set Counting - A Hybrid Approach. IJCAI 2022: 2620-2626 - [c35]Johannes Klaus Fichte, Sarah Alice Gaggl, Markus Hecher, Dominik Rusovac:
IASCAR: Incremental Answer Set Counting by Anytime Refinement. LPNMR 2022: 217-230 - [c34]Ridhwan Dewoprabowo, Johannes Klaus Fichte, Piotr Jerzy Gorczyca, Markus Hecher:
A Practical Account into Counting Dung's Extensions by Dynamic Programming. LPNMR 2022: 387-400 - [c33]Johannes Klaus Fichte, Markus Hecher, Valentin Roland:
Proofs for Propositional Model Counting. SAT 2022: 30:1-30:24 - [i24]Emmanuelle Dietz, Johannes Klaus Fichte, Florim Hamiti:
A Quantitative Symbolic Approach to Individual Human Reasoning. CoRR abs/2205.05030 (2022) - 2021
- [j9]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
DynASP2.5: Dynamic Programming on Tree Decompositions in Action. Algorithms 14(3): 81 (2021) - [j8]Johannes Klaus Fichte, Markus Hecher, Florim Hamiti:
The Model Counting Competition 2020. ACM J. Exp. Algorithmics 26: 13:1-13:26 (2021) - [c32]Johannes Klaus Fichte, Markus Hecher, Arne Meier:
Knowledge-Base Degrees of Inconsistency: Complexity and Counting. AAAI 2021: 6349-6357 - [c31]Johannes Klaus Fichte, Markus Hecher, Valentin Roland:
Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization. CP 2021: 24:1-24:20 - [c30]Johannes Klaus Fichte, Markus Hecher, Ciaran McCreesh, Anas Shahab:
Complications for Computational Experiments from Modern Processors. CP 2021: 25:1-25:21 - [c29]Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier:
Decomposition-Guided Reductions for Argumentation and Treewidth. IJCAI 2021: 1880-1886 - [i23]Johannes Klaus Fichte, Sarah Alice Gaggl, Dominik Rusovac:
Rushing and Strolling among Answer Sets - Navigation Made Easy. CoRR abs/2112.07596 (2021) - 2020
- [c28]Johannes Klaus Fichte, Markus Hecher, Maximilian F. I. Kieler:
Treewidth-Aware Quantifier Elimination and Expansion for QCSP. CP 2020: 248-266 - [c27]Johannes Klaus Fichte, Markus Hecher, Stefan Szeider:
A Time Leap Challenge for SAT-Solving. CP 2020: 267-285 - [c26]Johannes Klaus Fichte, Markus Hecher, Stefan Szeider:
Breaking Symmetries with RootClique and LexTopSort. CP 2020: 286-303 - [c25]Johannes Klaus Fichte, Norbert Manthey, Julian Stecklina, André Schidler:
Towards Faster Reasoners by Using Transparent Huge Pages. CP 2020: 304-322 - [c24]Johannes Klaus Fichte, Markus Hecher, André Schidler:
Solving the Steiner Tree Problem with few Terminals. ICTAI 2020: 293-300 - [c23]Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler:
Lower Bounds for QBFs of Bounded Treewidth. LICS 2020: 410-424 - [c22]Johannes Klaus Fichte, Markus Hecher, Patrick Thier, Stefan Woltran:
Exploiting Database Management Systems and Treewidth for Counting. PADL 2020: 151-167 - [i22]Johannes Klaus Fichte, Markus Hecher, Patrick Thier, Stefan Woltran:
Exploiting Database Management Systems and Treewidth for Counting. CoRR abs/2001.04191 (2020) - [i21]Johannes Klaus Fichte, Norbert Manthey, Julian Stecklina, André Schidler:
Towards Faster Reasoners By Using Transparent Huge Pages. CoRR abs/2004.14378 (2020) - [i20]Johannes Klaus Fichte, Markus Hecher, Stefan Szeider:
A Time Leap Challenge for SAT Solving. CoRR abs/2008.02215 (2020) - [i19]Johannes Klaus Fichte, Markus Hecher, André Schidler:
Solving the Steiner Tree Problem with few Terminals. CoRR abs/2011.04593 (2020) - [i18]Johannes Klaus Fichte, Markus Hecher, Florim Hamiti:
The Model Counting Competition 2020. CoRR abs/2012.01323 (2020)
2010 – 2019
- 2019
- [j7]Johannes Klaus Fichte, Martin Kronegger, Stefan Woltran:
A multiparametric view on answer set programming. Ann. Math. Artif. Intell. 86(1-3): 121-147 (2019) - [j6]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): 891-907 (2019) - [c21]Johannes Klaus Fichte, Markus Hecher, Arne Meier:
Counting Complexity for Reasoning in Abstract Argumentation. AAAI 2019: 2827-2834 - [c20]Johannes Klaus Fichte, Markus Hecher, Markus Zisser:
An Improved GPU-Based SAT Model Counter. CP 2019: 491-509 - [c19]Muhammad Ayaz Dzulfikar, Johannes Klaus Fichte, Markus Hecher:
The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper). IPEC 2019: 25:1-25:23 - [c18]Johannes Klaus Fichte, Markus Hecher:
Treewidth and Counting Projected Answer Sets. LPNMR 2019: 105-119 - [i17]Johannes Klaus Fichte, Markus Hecher:
Treewidth and Counting Projected Answer Sets. CoRR abs/1903.11316 (2019) - [i16]Mario Alviano, Carmine Dodaro, Johannes Klaus Fichte, Markus Hecher, Tobias Philipp, Jakob Rath:
Inconsistency Proofs for ASP: The ASP-DRUPE Format. CoRR abs/1907.10389 (2019) - [i15]Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler:
TE-ETH: Lower Bounds for QBFs of Bounded Treewidth. CoRR abs/1910.01047 (2019) - [i14]Jorge Fandinno, Johannes Klaus Fichte:
Proceedings of the twelfth Workshop on Answer Set Programming and Other Computing Paradigms 2019. CoRR abs/1912.09211 (2019) - 2018
- [c17]Johannes Klaus Fichte, Markus Hecher, Neha Lodha, Stefan Szeider:
An SMT Approach to Fractional Hypertree Width. CP 2018: 109-127 - [c16]Johannes Klaus Fichte, Markus Hecher, Stefan Woltran, Markus Zisser:
Weighted Model Counting on the GPU by Exploiting Small Treewidth. ESA 2018: 28:1-28:16 - [c15]Johannes Klaus Fichte, Markus Hecher:
Exploiting Treewidth for Counting Projected Answer Sets. KR 2018: 639-640 - [c14]Johannes Klaus Fichte, Markus Hecher, Irina Schindler:
Default Logic and Bounded Treewidth. LATA 2018: 130-142 - [c13]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
Exploiting Treewidth for Projected Model Counting and Its Limits. SAT 2018: 165-184 - [i13]Johannes Klaus Fichte, Michael Morak, Markus Hecher, Stefan Woltran:
Exploiting Treewidth for Projected Model Counting and its Limits. CoRR abs/1805.05445 (2018) - [i12]Johannes Klaus Fichte, Markus Hecher, Arne Meier:
Counting Complexity for Reasoning in Abstract Argumentation. CoRR abs/1811.11501 (2018) - [i11]Jorge Fandinno, Johannes Klaus Fichte:
Proceedings of the elevent Workshop on Answer Set Programming and Other Computing Paradigms 2018. CoRR abs/1812.03508 (2018) - 2017
- [c12]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
DynASP2.5: Dynamic Programming on Tree Decompositions in Action. IPEC 2017: 17:1-17:13 - [c11]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
Answer Set Solving with Bounded Treewidth Revisited. LPNMR 2017: 132-145 - [c10]Johannes Klaus Fichte, Martin Kronegger, Stefan Woltran:
A Multiparametric View on Answer Set Programming. ASPOCP@LPNMR 2017 - [c9]Johannes Klaus Fichte, Stefan Szeider:
Backdoor Trees for Answer Set Programming. ASPOCP@LPNMR 2017 - [c8]Johannes Klaus Fichte, Neha Lodha, Stefan Szeider:
SAT-Based Local Improvement for Finding Tree Decompositions of Small Width. SAT 2017: 401-411 - [i10]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
Answer Set Solving with Bounded Treewidth Revisited. CoRR abs/1702.02890 (2017) - [i9]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
DynASP2.5: Dynamic Programming on Tree Decompositions in Action. CoRR abs/1706.09370 (2017) - [i8]Johannes Klaus Fichte, Markus Hecher, Irina Schindler:
Default Logic and Bounded Treewidth. CoRR abs/1706.09393 (2017) - 2016
- [c7]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: 2813-2818 - [c6]Johannes Klaus Fichte, Arne Meier, Irina Schindler:
Strong Backdoors for Default Logic. SAT 2016: 45-59 - [i7]Johannes Klaus Fichte, Arne Meier, Irina Schindler:
Strong Backdoors for Default Logic. CoRR abs/1602.06052 (2016) - [i6]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
Counting Answer Sets via Dynamic Programming. CoRR abs/1612.07601 (2016) - 2015
- [j5]Johannes Klaus Fichte, Stefan Szeider:
Backdoors to tractable answer set programming. Artif. Intell. 220: 64-103 (2015) - [j4]Johannes Klaus Fichte, Stefan Szeider:
Backdoors to Normality for Disjunctive Logic Programs. ACM Trans. Comput. Log. 17(1): 7 (2015) - [j3]Johannes Klaus Fichte, Miroslaw Truszczynski, Stefan Woltran:
Dual-normal logic programs - the forgotten class. Theory Pract. Log. Program. 15(4-5): 495-510 (2015) - [i5]Johannes Klaus Fichte, Miroslaw Truszczynski, Stefan Woltran:
Dual-normal Logic Programs - the Forgotten Class. CoRR abs/1507.05388 (2015) - 2014
- [i4]Albert Atserias, Johannes Klaus Fichte, Marc Thurley:
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution. CoRR abs/1401.3868 (2014) - 2013
- [j2]Johannes Klaus Fichte:
Backdoors to the Tractability of Answer Set Programming. Theory Pract. Log. Program. 13(4-5-Online-Supplement) (2013) - [c5]Johannes Klaus Fichte, Stefan Szeider:
Backdoors to Normality for Disjunctive Logic Programs. AAAI 2013: 320-327 - [c4]Johannes Klaus Fichte:
Backdoors to Tractability of Answer-Set Programming. AAAI 2013: 1662-1663 - [i3]Johannes Klaus Fichte, Stefan Szeider:
Backdoors to Normality for Disjunctive Logic Programs. CoRR abs/1301.1391 (2013) - 2012
- [i2]Johannes Klaus Fichte:
The Good, the Bad, and the Odd: Cycles in Answer-Set Programs. CoRR abs/1205.3663 (2012) - 2011
- [j1]Albert Atserias, Johannes Klaus Fichte, Marc Thurley:
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution. J. Artif. Intell. Res. 40: 353-373 (2011) - [c3]Johannes Klaus Fichte:
The Good, the Bad, and the Odd: Cycles in Answer-Set Programs. ESSLLI Student Sessions 2011: 78-90 - [c2]Johannes Klaus Fichte, Stefan Szeider:
Backdoors to Tractable Answer-Set Programming. IJCAI 2011: 863-868 - [i1]Johannes Klaus Fichte, Stefan Szeider:
Backdoors to Tractable Answer-Set Programming. CoRR abs/1104.2788 (2011)
2000 – 2009
- 2009
- [c1]Albert Atserias, Johannes Klaus Fichte, Marc Thurley:
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution. SAT 2009: 114-127
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 20:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
