|
Martin Kronegger |
|
I am a postdoctoral researcher at the Database and Artificial Intelligence Group at TU Wien. Before that I was a faculty member of the Database and Artificial Intelligence Group and of the Theory and Logic Group at the TU Wien. I finished my doctoral studies in computer science at the TU Wien with Reinhard Pichler as advisor. During my doctoral studies I contributed to the following project: Fixed-Parameter Tractability in Artificial Intelligence and Reasoning (FAIR). Currently, I am involved in the following project:
Activities
- Involved in the organization of PhDs in Logic VII 2015 (Co-organizer), ASP Competition 2013 (Collaborator of the organizing committee)
- PC member of IJCAI-16.
- Helping hand at the Vienna Summer of Logic (VSL 2014).
Talks and Presentations
- Variable-Deletion Backdoors to Planning. Poster presented and Poster-ad talk given at the 29th AAAI Conference on Artificial Intelligence (AAAI 2015), Austin, Texas, USA, 2015.
- Backdoors to Planning. Talk given at the 28th AAAI Conference on Artificial Intelligence (AAAI 2014), Québec City, Canada, 2014.
- Backdoors to Planning. Poster presented at the 28th AAAI Conference on Artificial Intelligence (AAAI 2014), Québec City, Canada, 2014.
- A Parameterized Complexity Analysis of Generalized CP-Nets. Poster presented at the 28th AAAI Conference on Artificial Intelligence (AAAI 2014), Québec City, Canada, 2014.
- Conformant Planning as a Case Study of Incremental QBF Solving. Invited talk given at the 2nd International Workshop on Quantified Boolean Formulas (QBF 2014), Vienna, Austria, 2014.
- Backdoors to Planning. Talk given at the 2nd Workshop on the Parameterized Complexity of Computational Reasoning (PCCR 2014), Vienna, Austria, 2014.
- Parameterized Complexity of Optimal Planning: A Detailed Map. Talk given at the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013), Beijing, China, 2013.
- Parameterized Complexity of Optimal Planning: A Detailed Map. Poster presented at the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013), Beijing, China, 2013.
- Conformant Planning as a Benchmark for QBF-Solvers. Talk given at the International Workshop on Quantified Boolean Formulas (QBF 2013), colocated with SAT 2013, Helsinki, Finland, 2013.
Publications
Most of my papers are also listed at DBLP Computer Science Bibliography.2016
- Multiparametric View on Answer Set Programming Technical Report, TU Wien, Vienna, Austria, 2016.
[ Abstract | BibTeX | PDF ] - Conformant Planning as a Case Study of Incremental QBF Solving In Annals of Mathematics and Artificial Intelligence: 1-25, 2016.
[ Abstract | BibTeX | PDF ] - On the Parameterized Complexity of Planning Ph.D. Thesis, TU Wien, 2016.
[ Abstract | BibTeX ]
2015
- Intra- and Interdiagram Consistency Checking of Behavioral Multiview Models In Computer Languages, Systems and Structures, 44: 72-88, 2015.
[ Abstract | BibTeX | PDF ] - Fixed-parameter Tractable Reductions to SAT for Planning In Proc. of the 24th International Joint Conference on Artificial Intelligence (IJCAI-15), pages 2897-2903, AAAI Press, 2015.
[ Abstract | BibTeX | PDF ] - Parameterized Complexity of Asynchronous Border Minimization In Proc. of Theory and Applications of Models of Computing (TAMC-15), pages 428-440, Springer, 2015.
[ Abstract | BibTeX | PDF ] - Variable-Deletion Backdoors to Planning In Proc. of the 29th AAAI Conference on Artificial Intelligence (AAAI-15), pages 3305-3312, AAAI Press, 2015.
[ Abstract | BibTeX | PDF | Supplementary Material ]
2014
- Conformant Planning as a Case Study of Incremental QBF Solving In Proc. of the 12th International Conference on Artificial Intelligence and Symbolic Computation (AISC 2014), pages 120-131, Springer, 2014.
[ Abstract | BibTeX | PDF ] - Backdoors to Planning In Proc. of the 28th AAAI Conference on Artificial Intelligence (AAAI-14), pages 2300-2307, AAAI Press, 2014.
[ Abstract | BibTeX | PDF ] - A Parameterized Complexity Analysis of Generalized CP-Nets In Proc. of the 28th AAAI Conference on Artificial Intelligence (AAAI-14), pages 1091-1097, AAAI Press, 2014.
[ Abstract | BibTeX | PDF ] - A SAT-Based Debugging Tool for State Machines and Sequence Diagrams In Proc. SLE 2014, pages 21-40, Springer, LNCS , 2014, Best Paper Award.
[ Abstract | BibTeX | PDF ]
2013
- Global State Checker: Towards SAT-Based Reachability Analysis of Communicating State Machines In Proc. of the 10th Model-Driven Engineering, Verification, and Validation Workshop (MoDeVVa 2013) colocated with MODELS 2013, pages 31-40, CEUR Workshop Proceedings , 2013.
[ Abstract | BibTeX | PDF ] - The Fourth Answer Set Programming Competition: Preliminary Report In Proc. of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013), pages 42-53, Springer, LNCS 8148, 2013.
[ Abstract | BibTeX | PDF ] - VCWC: A Versioning Competition Workflow Compiler In Proc. of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013), pages 233-238, Springer, LNCS 8148, 2013.
[ Abstract | BibTeX | PDF ] - A Parameterized Complexity Analysis of Generalized CP-Nets In Proc. of the 7th Multidisciplinary Workshop on Advances in Preference Handling (M-PREF 2013) colocated with IJCAI-13, 2013.
[ Abstract | BibTeX | PDF ] - Conformant Planning as a Benchmark for QBF-Solvers In Proc. of the International Workshop on Quantified Boolean Formulas (QBF 2013) colocated with SAT 2013, pages 1-5, 2013.
[ Abstract | BibTeX | PDF ] - Parameterized Complexity of Optimal Planning: A Detailed Map In Proc. of the 23rd International Joint Conference on Artificial Intelligence (IJCAI-13), pages 954-961, AAAI Press, 2013.
[ Abstract | BibTeX | PDF ]
Teaching
-
184.685 VU 2.0 Data Modelling
[ 2015S, 2014W, 2014S, 2013W, 2013S, 2012W, 2012S, 2011W ] -
185.A06 VU 2.0 Formal Modelling
[ 2015S, 2014W, 2014S, 2013W, 2013S, 2012W, 2012S, 2011W ] -
184.688 PR 4.0 Project in Computer Science 1
[ 2015S, 2014W, 2014S, 2013W, 2013S ] -
184.689 PR 4.0 Project in Computer Science 2
[ 2015S, 2014W, 2014S, 2013W, 2013S ] -
184.696 PR 6.0 Project in Software Engineering & Internet Computing
[ 2015S, 2014W, 2014S, 2013W ]
Miscellaneous
- If you are interested in graph theory, take a look at this script (PDF) which was written for the lecture 186.181 VU 2.0 Algorithms in Graph Theory held by tit.a.o.Prof. Dr. Herbert Fleischner. The first version appeared in 2012.
- We developed a Java interface to DepQBF, called DepQBF4J, which enables Java applications to use the API of DepQBF in Java. This way, your Java applications benefit from the advantages of incremental QBF solving, QBF solving under assumptions, using an API instead of writing QBF formulas to files etc. DepQBF4J is contained in the newest version of DepQBF which is available for download at http://lonsing.github.io/depqbf/.
-
You are a graduate student, interested in logic, algorithms and artificial intelligence, and are looking for a challenging master's/PhD program in Vienna, Austria?
Great! Check out the master's program "Computational Intelligence" and the doctoral program "Logical Methods in Computer Science" (LogiCS) at http://logic-cs.at/.
Contact Information
Martin Kronegger
TU Wien
Institute of Informations Systems E184-2
Favoritenstraße 9-11
1040 Wien, Austria
Phone: +43 (1) 58801 184802
Fax: +43 (1) 58801 9184802
e-mail: [lastname] [at] dbai tuwien ac at
