Dipl.-Ing. Dr.techn.
Günther Charwat
| Institute | TU Wien Institute of Logic and Computation Database and Artificial Intelligence Group |
|---|---|
| Address | Favoritenstraße 9-11 1040 Wien Austria |
| Room | HE 03 32 |
 |
|
| Phone | +43-1-58801-740018 |
| Fax | +43-1-58801-9740018 |
See also: TISS Adress Book
Office Hours: By appointment (send me an e-mail)
About
I am a former postdoctoral researcher at the Database and Artificial Intelligence Group of TU Wien and was employed as a project assistent in the FWF-funded Decodyn Project ("Treating Hard Problems with Decomposition and Dynamic Programming"). I received my PhD under the supervision of Stefan Woltran.
I am interested in the design and implementation of novel algorithms for solving computationally hard problems (including development of dedicated search- or expansion-based approaches, and heuristics). Problem domains include quantified Boolean formulae (QBFs) and applications of answer set programming (ASP). I am involved in the development of several software frameworks and systems, including:
- dynQBF, an expansion-based QBF solver that exploits structural properties of the input by utilizing tree decompositions and dependency schemes;
- dynBDD, a software that relies on Binary Decision Diagrams (BDDs) for efficiently representing intermediate results during dynamic programming over a tree decomposition of the input;
- D-FLAT, a software framework that allows one to specify tree decomposition based algorithms in Answer Set Programming (ASP);
- dynPARTIX, a reasoning tool in the area of Abstract Argumentation;
- ARVis, for visualizing relations between answer sets; and
- Democratix, an ASP-based tool for evaluating preference profiles (elections) with respect to various voting rules.
Teaching
-
181.034 SE 2.0 Artifical Intelligence Seminar
[ 2016S, 2015S, 2014S, 2013S ] -
184.685 VU 2.0 Data Modelling
[ 2014S, 2013W, 2013S, 2012W, 2012S ] -
184.688 PR 4.0 Project in Computer Science 1
[ 2014S, 2013W, 2013S, 2012W ] -
184.689 PR 4.0 Project in Computer Science 2
[ 2014S, 2013W, 2013S, 2012W ] -
184.696 PR 6.0 Project in Software Engineering & Internet Computing
[ 2014S, 2013W, 2012W ]
Publications
2019
- Expansion-based QBF Solving on Tree Decompositions In Sumbitted to Fundamenta Informaticae, 2019.
[ Abstract | BibTeX | pdf ]
2017
- Expansion-based QBF Solving on Tree Decompositions In Proc. of the 24th International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA@AI*IA 2017), Volume 2011 of CEUR Workshop Proceedings, pages 16-26, CEUR-WS.org, 2017.
[ BibTeX | pdf ] - BDD-based Dynamic Programming on Tree Decompositions - Towards an Alternative Approach for Efficient QBF Solving Ph.D. Thesis, Fakultät für Informatik an der Technischen Universität Wien, 2017.
Stefan Woltran advisor.
[ Abstract | BibTeX ]
2016
- D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy In Fundamenta Informaticae, 147 (1): 27-61, 2016.
[ Abstract | BibTeX | doi ] - BDD-based Dynamic Programming on Tree Decompositions Technical Report DBAI-TR-2016-95, DBAI, Fakultät für Informatik an der Technischen Universität Wien, 2016.
[ Abstract | BibTeX | pdf ] - Dynamic Programming-based QBF Solving In Proc. of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016), Volume 1719 of CEUR Workshop Proceedings, pages 27-40, CEUR-WS.org, 2016.
[ Abstract | BibTeX | pdf ] - Subset Minimization in Dynamic Programming on Tree Decompositions In AAAI-16 Workshop on Beyond NP, WS-16-05 , pages 300-306, 2016.
[ Abstract | BibTeX | pdf ]
2015
- D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy Technical Report DBAI-TR-2015-93, DBAI, TU Wien, 2015.
[ Abstract | BibTeX | pdf ] - Computing Secure Sets in Graphs using Answer Set Programming In Journal of Logic and Computation, 2015.
(Special issue of ASPOCP 2014)
[ Abstract | BibTeX | pdf ] - Efficient Problem Solving on Tree Decompositions using Binary Decision Diagrams In Proc. of the 13th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2015), Volume 9345 of LNCS, pages 213-227, Springer, 2015.
[ Abstract | BibTeX | pdf | ] - Democratix: A Declarative Approach to Winner Determination In Proc. of the 4th International Conference on Algorithmic Decision Theory (ADT 2015), Volume 9346 of LNCS, pages 253-269, Springer, 2015.
[ Abstract | BibTeX | pdf | | system page ] - Dynamic Programming on Tree Decompositions using Binary Decision Diagrams: Research Summary In Proc. of the Technical Communications of the 31st International Conference on Logic Programming (ICLP 2015), Volume 1433 of CEUR Workshop Proceedings, CEUR-WS.org, 2015.
[ Abstract | BibTeX | pdf ] - D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy In Eighth Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2015), 2015.
[ Abstract | BibTeX | pdf | system page ] - Methods for Solving Reasoning Problems in Abstract Argumentation - A Survey In Artificial Intelligence, 220 (0): 28-63, 2015.
[ Abstract | BibTeX | doi ]
2014
- The D-FLAT System for Dynamic Programming on Tree Decompositions In Proc. of the 14th European Conference on Logics in Artificial Intelligence (JELIA 2014), Volume 8761 of LNCS, pages 558-572, Springer, 2014.
[ Abstract | BibTeX | pdf | system page ] - The D-FLAT System for Dynamic Programming on Tree Decompositions In Fourth International Workshop on Logic and Search (LaSh 2014), 2014.
[ Abstract | BibTeX | pdf ] - DEMOCRATIX: A Declarative Approach to Winner Determination In Fifth International Workshop on Computational Social Choice (COMSOC 2014), 2014.
[ Abstract | BibTeX | pdf | system page ] - Computing Secure Sets in Graphs using Answer Set Programming In Seventh Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2014), 2014.
[ Abstract | BibTeX | pdf ] - D-FLAT: Progress Report Technical Report DBAI-TR-2014-86, DBAI, Vienna University of Technology, 2014.
[ Abstract | BibTeX | pdf ]
2013
- The Fourth Answer Set Programming Competition: Preliminary Report In Proc. of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013), Volume 8148 of LNCS, pages 42-53, Springer, 2013.
[ Abstract | BibTeX | pdf ] - ARVis: Visualizing Relations between Answer Sets In Proc. of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013), Volume 8148 of LNCS, pages 73-78, Springer, 2013.
[ Abstract | BibTeX | pdf | | poster | system page ] - VCWC: A Versioning Competition Workflow Compiler In Proc. of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013), Volume 8148 of LNCS, pages 233-238, Springer, 2013.
[ Abstract | BibTeX | pdf ] - Implementing Abstract Argumentation - A Survey Technical Report DBAI-TR-2013-82, DBAI, Vienna University of Technology, 2013.
[ Abstract | BibTeX | pdf ]
2012
- Utilizing ASP for Generating and Visualizing Argumentation Frameworks In Proc. of the Fifth Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2012), pages 51-65, 2012.
[ Abstract | BibTeX | pdf | | system page ] - dynPARTIX 2.0 - Dynamic Programming Argumentation Reasoning Tool In Proc. of the Fourth International Conference on Computational Models of Argument (COMMA 2012), Volume 245 of Frontiers in Artificial Intelligence and Applications, pages 507-508, IOS Press, 2012.
[ Abstract | BibTeX | pdf | system page ] - Tree-decomposition based Algorithms for Abstract Argumentation Frameworks Master's Thesis, Vienna University of Technology, 2012.
Stefan Woltran and Wolfgang Dvořák advisors
[ Abstract | BibTeX | pdf | poster ]
Other Interests
animals & nature (Tierpark Wolfsgraben), photography, archery, and more...
