Skip to Content

TU Wien Fakultät für Informatik DBAI Database and Artificial Intelligence Group
Top-level Navigation: Current-level Navigation:

Path: DBAI > staff > Johannes Fichte

Tools: Drucken



Johannes Fichte



portrait

Institute Technische Universität Wien
Institute of Information Systems
Database and Artificial Intelligence Group
Address Favoritenstraße 9-11
1040 Wien
Austria
Room HA0302
Mail fichte at dbai dot tuwien dot ac do at
Phone +43-1-58801-740061
Phone (Potsdam) +49/331/9773091
Fax +43-1-58801-9740018

TISS: Johannes Fichte

Office Hours: By appointment (send me an e-mail)

About me

I am a PostDoc with the Database and Artificial Intelligence Group of the Institute of Information Systems at Technische Universität Wien. My research is funded through Prof. Woltran's FWF START-grant on the research project "Decodyn: Treating Hard Problems with Decomposition and Dynamic Programming (Y698)". I received my PhD under supervision of Stefan Szeider and co-supervision of Torsten Schaub.

Research Interest

My work interests in computational complexity theory and its applications. In particular I work on the understanding of the gap between intractability (strong theoretical evidence) and practical efficient solutions (industrial/structured setting). I consider the boolean satisfiablity problem (SAT) and answer-set programming (ASP).

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

2016

  1. Johannes Klaus Fichte, Arne Meier and Irina Schindler Strong Backdoors for Default Logic In CoRR, abs/1602.06052, 2016.
    [ BibTeX ]
  2. Johannes K. Fichte, Arne Meier and Irina Schindler Strong Backdoors for Default Logic In Proceedings of the 19th International Conference Theory and Applications of Satisfiability Testing (SAT'16), Bordeaux, France, Lecture Notes in Computer Science , pages 45-59, Springer, 2016.
    [ BibTeX ]

2015

  1. Johannes K. Fichte Backdoors to Tractability of Disjunctive Answer Set Programming Ph.D. Thesis, Fakultät für Informatik an der Technischen Universität Wien, 2015.
    [ BibTeX ]
  2. Johannes K. Fichte and Stefan Szeider Backdoors to Tractable Answer-Set Programming In Artificial Intelligence, 220 (0): 64-103, 2015.
    Extended and updated version of a paper that appeared in em Proc. of the 22nd International Conference on Artificial Intelligence (IJCAI'11).
    [ BibTeX ]
  3. Johannes K. Fichte and Stefan Szeider Backdoors to Normality for Disjunctive Logic Programs In ACM Trans. Comput. Log., 17 (1), 2015.
    Extended and updated version of a paper that appeared in em Proc. of the 27th AAAI Conference on Artificial Intelligence (AAAI'13).
    [ BibTeX ]
  4. Johannes K. Fichte, Miroslaw Truszczyński and Stefan Woltran Dual-normal programs -- The forgotten class In Theory Pract. Log. Program., 2015.
    CoRR: 1507.05388. Proceedings of the 31st International Conference on Logic Programming (ICLP'15).
    [ BibTeX ]

2013

  1. Johannes K. Fichte Backdoors to Tractability of Answer-Set Programming In Proceedings of the 27th AAAI Conference on Artificial Intelligence (Proceedings of the 18th AAAI-SIGART Doctoral Consortium) (AAAI DC'13), Bellevue, WA, USA, pages 1662-1663, AAAI Press, 2013.
    [ BibTeX ]
  2. Johannes K. Fichte Backdoors to Tractability of Answer-Set Programming In 9th ICLP Doctoral Consortium (ICLP DC) -- ICLP Technical Communications on-line supplement of Theory and Practice of Logic Programming (TPLP), Volume 13 of 4-5, pages 1-10, 2013.
    [ BibTeX ]
  3. Johannes K. Fichte and Stefan Szeider Backdoors to Normality for Disjunctive Logic Programs In Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI'13), Bellevue, WA, USA, pages 320-327, AAAI Press, 2013.
    A preliminary version of the paper was presented on the Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP'12).
    [ BibTeX ]

2012

  1. Johannes K. Fichte The Good, the Bad, and the Odd: Cycles in Answer-Set Programs In Proceedings of the 23rd European Summer School in Logic, Language and Information (ESSLLI'11) and in New Directions in Logic, Language and Computation (ESSLLI'10 and ESSLLI'11 Student Sessions, Selected Papers Series), Volume 7415 of Lecture Notes in Computer Science, pages 78-90, Springer, 2012.
    [ Abstract | BibTeX ]
  2. Johannes K. Fichte and Stefan Szeider Backdoors to Normality for Disjunctive Logic Programs In Proceedings of the 5th International Workshop Answer Set Programming and Other Computing Paradigms (ASPOCP'12), Budapest, Hungary, Volume abs/cs/1301.1391v2 of CoRR, pages 99-114, 2012.
    [ BibTeX ]
  3. Johannes Klaus Fichte and Stefan Szeider Backdoors to Tractable Answer-Set Programming Technical Report, arXiv:1104.2788, 2012.
    Extended and updated version of a paper that appeared in em Proceedings of the 22nd International Conference on Artificial Intelligence (IJCAI'11).
    [ BibTeX ]

2011

  1. Albert Atserias, Johannes Klaus Fichte and Marc Thurley Clause-learning algorithms with many restarts and bounded-width resolution In J. Artif. Intell. Res., 40: 353-373, 2011.
    [ BibTeX ]
  2. Johannes Klaus Fichte The Good, the Bad, and the Odd: Cycles in Answer-Set Programs In Proceedings of the 23rd European Summer School in Logic, Language, & Information (ESSLLI '11) Student Session, 2011.
    [ BibTeX ]
  3. Johannes K. Fichte and Stefan Szeider Backdoors to Tractable Answer-Set Programming In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI'11), Barcelona, Catalonia, Spain, pages 863-868, AAAI Press/IJCAI, 2011.
    [ BibTeX ]

2009

  1. Johannes K. Fichte Abstract State Machines Programmieren mit Strukturen Master's Thesis, Humboldt-Universität zu Berlin, 2009.
    Diploma Thesis
    [ BibTeX ]
  2. Albert Atserias, Johannes Klaus Fichte and Marc Thurley Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution In Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing (SAT'09), Swansea, UK, Volume 5584 of LNCS, pages 114-127, springer, 2009.
    [ BibTeX ]

Programs and Utils

Checkout my repositories on github.

I am involved in the development of some software utils, including:

2016

  1. Johannes K. Fichte, Markus Hecher, Michael Morak and Stefan Woltran dynASP2 -- A dynamic programming based answer set programming solver 2016.
    [ BibTeX | system page  ]
  2. Johannes K. Fichte daajoe/gtfs2graphs -- A GTFS transit feed to Graph Format Converter 2016.
    [ BibTeX | system page  ]
  3. Johannes K. Fichte daajoe/transitfeed -- Fork of the google GTFS transit feed library transitfeed 2016.
    [ BibTeX | system page  ]
  4. Johannes K. Fichte daajoe/PACE2016_transit_graphs -- Transit feeds A PACE 2016 Competition Instance Set 2016.
    [ BibTeX | system page  ]

Conference Activities


Home / Kontakt / Webmaster / Offenlegung gemäß § 25 Mediengesetz: Inhaber der Website ist das Institut für Informationssysteme an der Technischen Universität Wien, 1040 Wien. Die TU Wien distanziert sich von den Inhalten aller extern gelinkten Seiten und übernimmt diesbezüglich keine Haftung. / Disclaimer.