Johannes K. Fichte
| Institute | Technische Universität Wien Institute of Information Systems Database and Artificial Intelligence Group |
|---|---|
| Address | Favoritenstraße 9-11 1040 Wien Austria |
| Room | HA0302 |
 |
|
| Phone | +43-1-58801-740061 |
| Fax | +43-1-58801-9740018 |
You can find more information in the TISS: Address Book. For courses, see my web page faculty of Informatics.
Office Hours: By appointment (send me an e-mail)
About me
I am a researcher in the Database and Artificial Intelligence Group(DBAI) of the Institute of Information Systems at Technische Universität Wien. Previouly, I was a research fellow in the Simons Institute at UC Berkeley and in the Knowledge Representation and Reasoning Group at TU Dresden. I received my PhD under supervision of Stefan Szeider and co-supervision of Torsten Schaub from TU Wien.Research Interest
My work interests in computational algorithmics, complexity, and practical applications thereof, including implementations of parameterized algorithms for various combinatorial hard problems. I focus on model counting propositional formulas and various formalisms in AI, the Boolean satisfiablity problem (SAT), and answer-set programming (ASP). I have an industry background in applications of data analysis and evaluation in health care.Supervision of Bachelor/Master Theses
I am happy to supervise theses of motivated students in topics related to my research area. If you have ideas or questions regarding possible topics, please contact me.Publications
See also my DPLP Entry and my Google Scholar Profile.2021
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action In Algorithms, 14 (3): 81, 2021.
[ BibTeX | doi ] - Knowledge-Base Degrees of Inconsistency: Complexity and Counting In Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021, pages 6349-6357, AAAI Press, 2021.
[ BibTeX ] - Complications for Computational Experiments from Modern Processors In 27th International Conference on Principles and Practice of Constraint Programming, CP 2021, Montpellier, France (Virtual Conference), October 25-29, 2021, Volume 210 of LIPIcs, pages 25:1-25:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[ BibTeX | doi ] - Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization In 27th International Conference on Principles and Practice of Constraint Programming, CP 2021, Montpellier, France (Virtual Conference), October 25-29, 2021, Volume 210 of LIPIcs, pages 24:1-24:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[ BibTeX | doi ] - Decomposition-Guided Reductions for Argumentation and Treewidth In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021, pages 1880-1886, ijcai.org, 2021.
[ BibTeX | doi ]
2020
- Treewidth-Aware Quantifier Elimination and Expansion for QCSP In Principles and Practice of Constraint Programming - 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7-11, 2020, Proceedings, Volume 12333 of Lecture Notes in Computer Science, pages 248-266, Springer, 2020.
[ BibTeX | doi ] - A Time Leap Challenge for SAT-Solving In Principles and Practice of Constraint Programming - 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7-11, 2020, Proceedings, Volume 12333 of Lecture Notes in Computer Science, pages 267-285, Springer, 2020.
[ BibTeX | doi ] - Breaking Symmetries with RootClique and LexTopSort In Principles and Practice of Constraint Programming - 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7-11, 2020, Proceedings, Volume 12333 of Lecture Notes in Computer Science, pages 286-303, Springer, 2020.
[ BibTeX | doi ] - Towards Faster Reasoners by Using Transparent Huge Pages In Principles and Practice of Constraint Programming - 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7-11, 2020, Proceedings, Volume 12333 of Lecture Notes in Computer Science, pages 304-322, Springer, 2020.
[ BibTeX | doi ] - Solving the Steiner Tree Problem with few Terminals In 32nd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2020, Baltimore, MD, USA, November 9-11, 2020, pages 293-300, IEEE, 2020.
[ BibTeX | doi ] - Lower Bounds for QBFs of Bounded Treewidth In LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020, pages 410-424, ACM, 2020.
[ BibTeX | doi ] - Exploiting Database Management Systems and Treewidth for Counting In Practical Aspects of Declarative Languages - 22nd International Symposium, PADL 2020, New Orleans, LA, USA, January 20-21, 2020, Proceedings, Volume 12007 of Lecture Notes in Computer Science, pages 151-167, Springer, 2020.
[ BibTeX | doi ] - Exploiting Database Management Systems and Treewidth for Counting In CoRR, abs/2001.04191, 2020.
[ BibTeX ] - Towards Faster Reasoners By Using Transparent Huge Pages In CoRR, abs/2004.14378, 2020.
[ BibTeX ] - A Time Leap Challenge for SAT Solving In CoRR, abs/2008.02215, 2020.
[ BibTeX ] - Solving the Steiner Tree Problem with few Terminals In CoRR, abs/2011.04593, 2020.
[ BibTeX ] - The Model Counting Competition 2020 In CoRR, abs/2012.01323, 2020.
[ BibTeX ]
2019
- A multiparametric view on answer set programming In Ann. Math. Artif. Intell., 86 (1-3): 121-147, 2019.
[ BibTeX | doi ] - Inconsistency Proofs for ASP: The ASP - DRUPE Format In Theory Pract. Log. Program., 19 (5-6): 891-907, 2019.
[ BibTeX | doi ] - Counting Complexity for Reasoning in Abstract Argumentation In The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, The Thirty-First Innovative Applications of Artificial Intelligence Conference, IAAI 2019, The Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, Honolulu, Hawaii, USA, January 27 - February 1, 2019, pages 2827-2834, AAAI Press, 2019.
[ BibTeX | doi ] - An Improved GPU-Based SAT Model Counter In Principles and Practice of Constraint Programming - 25th International Conference, CP 2019, Stamford, CT, USA, September 30 - October 4, 2019, Proceedings, Volume 11802 of Lecture Notes in Computer Science, pages 491-509, Springer, 2019.
[ BibTeX | doi ] - The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper) In 14th International Symposium on Parameterized and Exact Computation, IPEC 2019, September 11-13, 2019, Munich, Germany, Volume 148 of LIPIcs, pages 25:1-25:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
[ BibTeX | doi ] - Treewidth and Counting Projected Answer Sets In Logic Programming and Nonmonotonic Reasoning - 15th International Conference, LPNMR 2019, Philadelphia, PA, USA, June 3-7, 2019, Proceedings, Volume 11481 of Lecture Notes in Computer Science, pages 105-119, Springer, 2019.
[ BibTeX | doi ] - Treewidth and Counting Projected Answer Sets In CoRR, abs/1903.11316, 2019.
[ BibTeX ] - Inconsistency Proofs for ASP: The ASP-DRUPE Format In CoRR, abs/1907.10389, 2019.
[ BibTeX ] - TE-ETH: Lower Bounds for QBFs of Bounded Treewidth In CoRR, abs/1910.01047, 2019.
[ BibTeX ] - Proceedings of the twelfth Workshop on Answer Set Programming and Other Computing Paradigms 2019 In CoRR, abs/1912.09211, 2019.
[ BibTeX ]
2018
- An SMT Approach to Fractional Hypertree Width In Principles and Practice of Constraint Programming - 24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings, Volume 11008 of Lecture Notes in Computer Science, pages 109-127, Springer, 2018.
[ BibTeX | doi ] - Weighted Model Counting on the GPU by Exploiting Small Treewidth In 26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland, Volume 112 of LIPIcs, pages 28:1-28:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
[ BibTeX | doi ] - Exploiting Treewidth for Counting Projected Answer Sets In Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, KR 2018, Tempe, Arizona, 30 October - 2 November 2018, pages 639-640, AAAI Press, 2018.
[ BibTeX ]
Programs and Utils
Checkout my repositories on github.
I am involved in the development of some software utils, including: dpdb and versions thereof, gpusat, frasmt, trellis.
In addition, I work on solver evaluations Time Leap Challenge, Evaluations of Solvers, Model Counting Competition, and Combinatorial Challenges.Community Activities
Co-Charing
- Publicity Co-Chair in the Local Organization of the 31st International Joint Conference on Artificial Intelligence (IJCAI-22)
- Co-Chair of the Workshop on Counting and Sampling@SAT (2021 and 2022)
- Co-Chair of the Model Counting Workshop@SAT (2020)
- Co-Organizer of the Model Counting Competition 2021
- Co-Organizer of the Model Counting Competition 2022
- Co-Organizer of the First Model Counting Competition 2020
- Co-Organizer of the PACE Challenge 2019
- Steering Committee Member of the PACE Challenge since 2019
- Member of the Local Organization of the 21st International Conference on Extending Database Technology and 21st International Conference on Database Theory (EDBT/ICDT'18)
- Co-Chair of the Local Organization of the 1st Workshop on Trends and Applications of Answer Set Programming (TAASP'16)
- Co-Organizer of the Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP'19)
- Co-Organizer of the Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP'18_
Program Comittee Member
- PC Member of the 34th, 35th, 36th, and 37th AAAI Conference on Artificial Intelligence (AAAI'19,'20,'21,'22) Student Abstract and Poster Program (AAAI'21)
- PC Member of the 27th, 28th, 29th, and 30th International Joint Conference on Artificial Intelligence (IJCAI'18,'19,'20,'21,'22)
- PC Member of the 37th International Conference on Logic Programming (ICLP'21 Doctoral Consortium)
- PC Member of the 17th Conference on Principles of Knowledge Representation and Reasoning (KR'20)
- PC Member of the 26th Conference on Constraint Programming (CP'20)
- PC Member of the 24th European Conference on Artificial Intelligence (ECAI'20)
- PC Member of the 15th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'19)
- PC Member of the 18th, 19th, 20th International Conference of the Italian Association for Artificial Intelligence (AIxIA'19,'20,'21)
- PC Member of the VCLA International Student Awards 2018
- PC Member of the 18th EPIA Conference on Artificial Intelligence (EPIA'17)
- PC Member of the 7th, 8th, and 9th Workshop on Answer Set Programming and Other Computing PC Member Paradigms (ASPOCP'14,'15,'16,'17,'18,'20)
- Editorial Board Member of Journal on Experimental Results, Cambridge University Press