Skip to Content

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

Path: DBAI > Research > Projects > Decodyn Project

Tools: Print


Project: Treating Hard Problems with Decomposition and Dynamic Programming (Decodyn)

FWF
(funded by the Austrian Science Fund (FWF) under grant Y698)

This page contains the news archive for the Decodyn project.

News Archive

LP/CP Programming Contest 2018

2018-07-16
Programming Contest winning team picture

Congratulations to team members Markus Hecher and Johannes Fichte for winning together with Martin Gebser the on-site competition of the LP/CP Programming Contest 2018 at ICLP 2018. More information can be found here

Invited talk at JIAF 2018

2018-06-14

Stefan Woltran, invited speaker at JIAF 2018 , gave a talk on Solving (Q)SAT Problems via Tree Decompositions and Dynamic Programming.

You can download the complete set of slides here.

Master thesis on solving the #SAT problem on the GPU with dynamic program and OpenCL

2018-05

Congratulations to Markus Zisser who finished his Master thesis Solving the #SAT problem on the GPU with dynamic programming and OpenCL.

The full thesis is publicly available for download.

FoIKS'18 program chair

2017-11-09

PI Stefan Woltran is program chair for FoIKS'18 (Tenth International Symposium on Foundations of Information and Knowledge Systems). The symposium took place in Budapest, Hungary from May 14 - 18, 2018.

PhD thesis on answer set solving and alliance problems in graphs

2017-10-20

Congratulations to team member Bernhard Bliem who successfully defended his PhD thesis Treewidth in non-ground answer set solving and alliance problems in graphs.

Thesis abstract and the full thesis are publicly available for download.

PhD thesis on dynamic programming and QBF solving

2017-09-22
Defense

Team member Günther Charwat successfully defended his PhD thesis BDD-based dynamic programming on tree decompositions, which includes a novel expansion-based approach for QBF solving (resulting in the QBF solver dynQBF).

The thesis abstract is available here.

Congratulations!

PACE'17 Challenge results

2017-09-06
PACE'17 (heuristic treewidth decomposition): 3rd place certiciate

Our tree decomposition library htd successfully participated in the PACE'17 challenge and achieved the third place in the "heuristic treewidth decomposition" track. For more information see also the article on the PACE 2017 challenge.


PACE'17 (heuristic tree decomposition): handover of certificates

Certificates were issued in course of the IPEC'17 conference. Thank you to the competition organizers!

We will provide a link to the official challence results when they are available on the webpage of the PACE'17 challenge.

QBF Evaluation'17 results

2017-08-31

We are happy to announce that our tree decomposition-based QBF solver dynQBF is ranked eight (out of 29 participants) in the 2-QBF track and 13th (out of 30 participants) in the PCNF track of the competitive evaluation of QBF solvers 2017 (QBFEval'17).

The QBF competition provides invaluable insights into state-of-the-art QBF solving. We would thus like to thank the organizers for all their effort!

LPNMR'17 and IPEC'17 contributions

2017-07

The following papers have been accepted: Answer Set Solving with Bounded Treewidth Revisited (at LPNMR'17, the paper is available here), and DynASP2.5: Dynamic Programming on Tree Decompositions in Action (at IPEC'17, see our preprint).

dynQBF 1.0.0

2017-06-25

We prepared a major release of our QBF solver dynQBF. dynQBF 1.0.0 (final) is available for download (sources and binary) at https://github.com/gcharwat/dynqbf/releases.

PhD finished

2017-04-28

Team member Michael Abseher successfully defended his PhD thesis Tailored Tree Decompositions for Efficient Problem Solving. The thesis abstract is available here. Congratulations!

JAIR journal publication

2017-04-25

We are happy to announce that our article Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning is now publicly available. You can download the article here.

IJCAI'17: Accepted paper

2017-04-24

We are looking forward to present our paper The Impact of Treewidth on ASP Grounding and Solving at IJCAI'17 (August 19-25, 2017) in Melbourne, Australia. The paper is available here.

Software releases

2016-12-20

New versions of our frameworks and tools are now available for download:

Besides performance and stability inprovements, all tools now support tree decomposition optimization (via fitness criteria). See the respective github release notes for details.

First PACE challenge

2016-09-12

In a close race for podium positions, our tool htd achieved the third place in the "heuristic treewidth" track of the 1st PACE challenge.

Invited talk at STAIRS 2016

2016-08-30
Stefan Woltran showing practical methods for dynamic programming on tree decompositions
#ecai2016

Stefan Woltran, invited speaker at STAIRS 2016 (co-located with ECAI 2016), gave a talk on Dynamic Programming on Tree Decompositions in Practice.

Talk abstract and STAIRS'16 schedule are available here. You can download the complete set of slides here.

htd 0.9.9 released

2016-07-21

We are proud to announce that a new version of our efficient tree decomposition library has been released. It is the first version to support optimization of tree decompositions (w.r.t. custom optimization functions). You can download the source code at github.

COMMA 2016: Accepted papers

2016-07
Screenshot of GrappaVis with highlighting of different areas

We are looking forward to present our recent papers in the field of (abstract) argumentation GrappaVis - A System for Advanced Graph-Based Argumentation and On Efficiently Enumerating Semi-stable Extensions via Dynamic Programming on Tree Decompositions at COMMA'16, held in Potsdam.

FI Journal Publications

2016-06

Two articles, D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy and Shift Design with Answer Set Programming, have been accepted for publication in Fundamenta Informaticae.

IJCAI 2016: Accepted Papers

2016-04-07

We are delighted to announce that our paper ASP for Anytime Dynamic Programming on Tree Decompositions has been accepted at IJCAI 2016, which will take place in New York City.

Congratulations and welcome

2016-01-28

Martin Kronegger successfully defended his PhD thesis On the Parameterized Complexity of Planning (abstract), and joined the Decodyn team.
Congratulations, and welcome to the team!

PhD finished

2015-10-06

Congratulations to Johannes Fichte for successfully defending his PhD thesis Backdoors to Tractability of Disjunctive Answer Set Programming. The abstract of his thesis is available here.

2nd ASP Modeling Competition

2015-09-30
2nd ASP Competition

"Team Wien" (Michael Abseher, Günther Charwat) achieved the first place in the 2nd ASP Modeling Competition.

Congratulations!

LPNMR 2015 and ADT 2015: Accepted Papers

2015-06

We are looking forward to attending this year's LPNMR and ADT conferences (co-located in Lexington, Kentucky), and presenting two papers at LPNMR:

as well as two papers at ADT:

IJCAI 2015: Accepted Papers

2015-04
IJCAI 2015, Buenos Aires

Six papers have been accepted for presentation at this year's IJCAI conference in Buenos Aires. The list of all accepted papers is available here. You can find the complete conference schedule here.

See you in Buenos Aires!

Artificial Intelligence Journal publications

2015-02

We are happy to announce the publication of our papers "Methods for Solving Reasoning Problems in Abstract Argumentation - A Survey" and "Backdoors to Tractable Answer-Set Programming" in Artificial Intelligence, Volume 220.

School on Parameterized Algorithms and Complexity 2014

2014-08-17 to 2014-08-22
School on Parameterized Algorithms and Complexity 2014

Team members attended the School on Parameterized Algorithms and Complexity 2014 in Będlewo, Poland.

Talks covered a broad range of interesting topics, including FPT, W[1]-hardness, kernelization, ETH and treewidth. Schedule and slides are available here.

Project started

2014-06-01

The project has officially started on 2014-06-01 and will have a duration of six years.


Back to the Decodyn homepage.

Last updated: 2019-09-12 18:03

Home / Kontakt / Webmaster / Offenlegung gemäß § 25 Mediengesetz: Inhaber der Website ist das Institut für Logic and Computation 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 / Datenschutzerklärung