TU Wien Informatics

Role

2020

  • Treewidth-Aware Reductions of normal ASP to SAT - Is normal ASP harder than SAT after all? / M. Hecher / Talk: 4th Workshop on Trends and Applications of Answer Set Programming (TAASP 2020), Klagenfurt; 2020-11-23 - 2020-11-24
  • Solving the Steiner Tree Problem with few Terminals / J. Fichte, M. Hecher, A. Schidler / Talk: ICTAI 2020 - 32th International Conference on Tools with Artificial Intelligence, online conference; 2020-11-09 - 2020-11-11; in: "Proceedings of ICTAI 2020", (2020), 1 - 38
  • Structural Decompositions of Epistemic Logic Programs / M. Hecher, M. Morak, S. Woltran / Talk: ICLP 2020, Rende, Italien; 2020-09-18 - 2020-09-24; in: "International Conference on Logic Programming 2020 Workshop Proceedings co-located with 36th International Conference on Logic Programming {(ICLP} 2020), Rende, Italy, September 18-19, 2020", CEUR-WS.org, (2020), 1 - 13
  • Extending XORRO with Approximate Model Counting / F. Everardo, M. Hecher, A. Shukla / Talk: Workshop ASPOCP 2020, University of Calabria, Rende, Italy; 2020-09-18
  • Treewidth-aware Reductions of Normal {ASP} to {SAT} - Is Normal {ASP} Harder than {SAT} after All? / M. Hecher / Talk: KR 2020 - 17th International Conference on Principles of Knowledge Representation and Reasoning, Rhodos, Griechenland; 2020-09-12 - 2020-09-18; in: "Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, {KR} 2020, Rhodes, Greece, September 12-18, 2020", (2020), 485 - 495
  • An Approximate Model Counter for ASP / F. Everardo, M. Hecher, A. Shukla / Talk: NMR 2020 - 18th INTERNATIONAL WORKSHOP ON NON-MONOTONIC REASONING, Rhodes, Greece; 2020-09-12 - 2020-09-18; in: "18th INTERNATIONAL WORKSHOP ON NON-MONOTONIC REASONING", (2020), 208 - 216
  • Counting with Bounded Treewidth: Meta Algorithm and Runtime Guarantees / J. Fichte, M. Hecher / Talk: NMR 2020 - 18th INTERNATIONAL WORKSHOP ON NON-MONOTONIC REASONING, Rhodes, Greece; 2020-09-12 - 2020-09-18; in: "18th INTERNATIONAL WORKSHOP ON NON-MONOTONIC REASONING", (2020), 9 - 18
  • Treewidth-Aware Complexity in ASP:Not all Positive Cycles are Equally Hard / J. Fandinno, M. Hecher / Talk: NMR 2020 - 18th INTERNATIONAL WORKSHOP ON NON-MONOTONIC REASONING, Rhodos, Griechenland; 2020-09-12 - 2020-09-18; in: "18th INTERNATIONAL WORKSHOP ONNON-MONOTONIC REASONING", (2020), 48 - 57
  • Breaking Symmetries with RootClique and LexTopSort / J. Fichte, M. Hecher, S. Szeider / Talk: CP 2020 - 26th International Conference - Principles and Practice of Constraint Programming, Louvain-laNeuve, Belgium; 2020-09-07 - 2020-09-11; in: "Principles and Practice of Constraint Programming - 26th International Conference, {CP} 2020, Louvain-la-Neuve, Belgium, September 7-11, 2020, Proceedings", (2020), 286 - 303
  • A Time Leap Challenge for SAT-Solving / J. Fichte, M. Hecher, S. Szeider / Talk: CP 2020 - 26th International Conference - Principles and Practice of Constraint Programming, Louvain-laNeuve, Belgium; 2020-09-07 - 2020-09-11; in: "Principles and Practice of Constraint Programming - 26th International Conference, {CP} 2020, Louvain-la-Neuve, Belgium, September 7-11, 2020, Proceedings", (2020), 267 - 285
  • Treewidth-Aware Quantifier Elimination and Expansion for {QCSP} / J. Fichte, M. Hecher, M. Kieler / Talk: CP 2020 - 26th International Conference - Principles and Practice of Constraint Programming, Louvain-laNeuve, Belgium; 2020-09-07 - 2020-09-11; in: "Principles and Practice of Constraint Programming - 26th International Conference, {CP} 2020, Louvain-la-Neuve, Belgium, September 7-11, 2020, Proceedings", (2020), 248 - 266
  • Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology / M. Hecher, P. Thier, S. Woltran / Talk: DPSW 2020 - Declarative Problem Solving Workshop, Santiago de Compostela, Spain; 2020-08-29 - 2020-08-30
  • Lower Bounds for QBFs of Bounded Treewidth / J. Fichte, M. Hecher, A. Pfandler / Talk: LICS 2020, Saarbrücken, Germany; 2020-07-08 - 2020-07-11; in: "LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020", (2020), 410 - 424
  • Taming High Treewidth with Abstraction, Nested Dynamic Programming and Database Technology / M. Hecher, P. Thier, S. Woltran / Talk: SAT 2020 - 23rd International Conference on Theory and Applications of Satisfiability Testing, Alghero, Italy; 2020-07-03 - 2020-07-10; in: "Theory and Applications of Satisfiability Testing - {SAT} 2020 - 23rd International Conference, Alghero, Italy, July 3-10, 2020, Proceedings", (2020), 343 - 360
  • Structural Decompositions of Epistemic Logic Programs / M. Hecher, M. Morak, S. Woltran / Talk: 34th AAAI Conference on Artificial Intelligence (AAAI-20), New York, New York, USA; 2020-02-07 - 2020-02-12; in: "The Thirty-Fourth {AAAI} Conference on Artificial Intelligence, {AAAI} 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, {IAAI} 2020, The Tenth {AAAI} Symposium on Educational Advances in Artificial Intelligence, {EAAI} 2020, New York, NY, USA, February 7-12, 2020", (2020), 2830 - 2837
  • Exploiting Database Management Systems and Treewidth for Counting / J. Fichte, M. Hecher, P. Thier, S. Woltran / Talk: PADL 2020 - The 22nd International Symposium on Practical Aspects of Declarative Languages, New Orleans, Louisiana, United States; 2020-01-19 - 2020-01-25; in: "Practical Aspects of Declarative Languages - 22nd International Symposium, {PADL} 2020, New Orleans, LA, USA, January 20-21, 2020, Proceedings", (2020), 151 - 167

2019

  • Structural Decompositions of Epistemic Logic Programs / M. Hecher, M. Morak, S. Woltran / Talk: TAASP - Workshop on Trends and Applications of Answer Set Programming, Wien; 2019-11-18 - 2019-11-19; in: "TAASP 2019", (2019), 1 - 15
  • Answer Set Solving exploiting Treewidth and its Limits / M. Hecher / Talk: The 25th International Conference on Principles and Practice of Constraint Programming, Stamford, USA; 2019-09-30 - 2019-10-04; in: "CP 2019", (2019), 1 - 7
  • Improved GPU-Based SAT Model Counter / J. Fichte, M. Hecher, M. Zisser / Talk: CP 2019 - Principles and Practice of Constraint Programming - 25th International Conference, Stamford, USA; 2019-09-30 - 2019-10-04; in: "Principles and Practice of Constraint Programming - 25th International Conference, CP 2019", Springer, 11802 (2019), ISBN: 978-3-030-30047-0; 491 - 509
  • Inconsistency Proofs for ASP: The ASP - DRUPE Format / M. Alviano, C. Dodaro, J. Fichte, M. Hecher, T. Philipp, J. Rath / Talk: ICLP 2019 - 35th International Conference on Logic Programming, Las Cruces, New Mexico, USA; 2019-09-20 - 2019-09-25; in: "Theory and Practice of Logic Programming", TPLP, 19 (2019), 891 - 907
  • gpusat2 - An Improved GPU Model Counter / J. Fichte, M. Hecher, M. Zisser / Talk: SAT 2019 - The 22nd International Conference on Theory and Applications of Satisfiability Testing, Lissabon; 2019-07-07 - 2019-07-12; in: "Pragmatics of SAT 2019 @ SAT 2019", (2019), 1 - 17
  • Inconsistency Proofs for ASP: The ASP-DRUPE Format / J. Fichte, M. Hecher, T. Philipp / Talk: Aspocp 2019 @ Lpnmr 2019, Philadelphia; 2019-06-03; in: "Aspocp 2019 @ Lpnmr 2019", (2019), 1 - 15
  • Treewidth and Counting Projected Answer Sets / J. Fichte, M. Hecher / Talk: LPNMR 2019 - Logic Programming and Nonmonotonic Reasoning, 15th International Conference, Philadelphia, USA; 2019-06-03 - 2019-06-07; in: "Logic Programming and Nonmonotonic Reasoning - 15th International Conference, LPNMR 2019", Springer, 11481 (2019), ISBN: 978-3-030-20527-0; 105 - 119
  • Counting Complexity for Reasoning in Abstract Argumentation / J. Fichte, M. Hecher, A. Meier / Talk: AAAI 2019 - 33rd Conference on Artificial Intelligence, Honolulu, Hawaii; 2019-01-27 - 2019-02-01; 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", (2019), ISBN: 978-1-57735-809-1; 2827 - 2834

2018

  • Exploiting Treewidth for Counting Projected Answer Sets / M. Hecher, J. Fichte / Talk: International Workshop on Non-Monotonic Reasoning (NMR), Tempe, Arizona, USA; 2018-10-27 - 2018-10-29; in: "17th International Workshop on Non-Monotonic Reasoning (NMR)", AAAI Press, (2018), 1 - 10
  • Exploiting Treewidth for Counting Projected Answer Sets / J. Fichte, M. Hecher / Talk: International Conference on Principles of Knowledge Representation and Reasoning - KR, Tempe, Arizona, USA; 2018-10-27 - 2018-10-29; in: "Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, {KR} 2018", AAAI Press, (2018), ISBN: 978-1-57735-803-9; 639 - 640
  • An {SMT} Approach to Fractional Hypertree Width / J. Fichte, M. Hecher, N. Lodha, S. Szeider / Talk: International Conference on Principles and Practice of Constraint Programming (CP), Lille, France; 2018-08-27 - 2018-08-31
  • Weighted Model Counting on the GPU by Exploiting Small Treewidth / J. Fichte, M. Hecher, S. Woltran, M. Zisser / Talk: European Symposium on Algorithms (ESA), Helsinki, Finnland; 2018-08-20 - 2018-08-24; in: "26th Annual European Symposium on Algorithms, {ESA} 2018", Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 112 (2018), ISBN: 978-3-95977-081-1; 1 - 16
  • Exploiting Treewidth for Projected Model Counting and Its Limits / J. Fichte, M. Hecher, M. Morak, S. Woltran / Talk: Theory and Applications of Satisfiability Testing - (SAT), Oxford, UK; 2018-07-09 - 2018-07-12; in: "Theory and Applications of Satisfiability Testing - (SAT 2018) - 21st International Conference, (SAT 2018)Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings", Springer, (2018), ISBN: 978-3-319-94143-1; 165 - 184
  • Default Logic and Bounded Treewidth / J. Fichte, M. Hecher, I. Schindler / Talk: Language and Automata Theory and Applications (LATA), Ramat Gan, Israel; 2018-04-09 - 2018-04-11; in: "12th International Conference Language and Automata theory and Applications (LATA)", Springer, 10792 (2018), ISBN: 978-3-319-77312-4; 130 - 142
  • An SMT Approach to Fractional Hypertree Width / J. Fichte, M. Hecher, N. Lodha, S. Szeider / in: "Principles and Practice of Constraint Programming", issued by: Springer Verlag; Springer-Verlag, 2018, 109 - 127
  • Dynamic Programming on Tree Decompositions with {D-FLAT} / M. Abseher, M. Hecher, M. Moldovan, S. Woltran, B. Bliem / KI - Künstliche Intelligenz, 32 (2018), 2-3; 191 - 192

2017

  • DynASP2.5: Dynamic Programming on Tree Decompositions in Action / J. Fichte, M. Hecher, M. Morak, S. Woltran / Talk: International Symposium on Parameterized and Exact Computation (IPEC), TU Wien; 2017-09-04 - 2017-09-08; in: "Proceedings of the 12th International Symposium on Parameterized and Exact Computation (IPEC'17)", D. Lokshtanov, N. Nishimura (ed.); (2017), 1 - 13
  • Answer Set Solving with Bounded Treewidth Revisited / M. Hecher, J. Fichte, M. Morak, S. Woltran / Talk: 14th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2017), Helsinki, Finland; 2017-07-03 - 2017-07-06; in: "Proc. of the 14th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2017)", M. Balduccini, T. Janhunen (ed.); Springer, (2017), 132 - 145
  • Structure-Driven Answer-Set Solving / M. Hecher / Talk: 14th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2017), Helsinki, Finland; 2017-07-03 - 2017-07-06; in: "4th International Conference on Logic Programming and Nonmonotonic Reasoning Doctoral Consortium (LPNMR DC)", (2017), 1

2016

2015

2014

  • The D-FLAT System for Dynamic Programming on Tree Decompositions. / M. Abseher, B. Bliem, G. Charwat, F. Dusberger, M. Hecher, S. Woltran / Talk: European Conference on Logics in Artificial Intelligence (JELIA), Madeira; 2014-09-24 - 2014-09-26; in: "Logics in Artificial Intelligence - 14th European Conference, JELIA 2014", E. Fermé, J. Leite (ed.); Springer, (2014), ISSN: 0302-9743; 558 - 572
  • D-FLAT: Progress Report / M. Abseher, B. Bliem, G. Charwat, F. Dusberger, M. Hecher, S. Woltran / Report for TU Wien, Institut fuer Informationssysteme; Report No. DBAI-TR-2014-86, 2014; 57 pages