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 > DYNASP Project

Tools: Print


DYNASP Project - Dynamic Programming and Answer Set Programming

(supported by special fund "Innovative Projekte 9006.09/008" of the Vienna University of Technology)


Contents


News

Research Project finished

31.07.2014

The project is finished. For information on subsequent research, see the D-FLAT and Decodyn project webpages.

Top

Project Goal

Answer Set Programming (ASP) is nowadays a well known and well acknowledged paradigm for declarative problem solving as can be seen by many successful applications in the areas of artificial intelligence and knowledge-based reasoning. Solving ground logic programs is, in general, still an intractable problem. Therefore most standard ASP solvers rely on techniques originating in SAT solving or constraint satisfaction problem solving. This project aims at the development of algorithms and corresponding implementations that use methods stemming from parameterized complexity theory (namely treewidth and hypertree width) in order to improve the performance of ASP solving for logic programs with low treewidth.

Top

Project Team

Project Staff:

Project Partners:

Top

Software

Top

Related Webpages

Top

Publications

2015

[23] Methods for Solving Reasoning Problems in Abstract Argumentation - A Survey
Günther Charwat, Wolfgang Dvořák, Sarah Alice Gaggl, Johannes Peter Wallner, Stefan Woltran
In Artificial Intelligence, 220: 28-63, 2015 (DOI)

2014

[22] The D-FLAT System for Dynamic Programming on Tree Decompositions
Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Markus Hecher, Stefan Woltran
In Proceedings of the 14th European Conference on Logics in Artificial Intelligence (JELIA 2014), pages 558-572, LNCS 8761, 2014 (link)
[21] The D-FLAT System for Dynamic Programming on Tree Decompositions
Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Markus Hecher, Stefan Woltran
In Fourth International Workshop on Logic and Search (LaSh 2014), 2014
[20] DEMOCRATIX: A Declarative Approach to Winner Determination
Günther Charwat, Andreas Pfandler
In Fifth International Workshop on Computational Social Choice (COMSOC 2014), 2014 (link)
[19] Computing Secure Sets in Graphs using Answer Set Programming
Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Stefan Woltran
In Seventh Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2014), 2014 (link)
[18] D-FLAT: Progress report
Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Markus Hecher, Stefan Woltran
Technical Report DBAI-TR-2014-86, Database and Artificial Intelligence Group, Vienna University of Technology, 2014 (link)

2013

[17] Implementing Abstract Argumentation - A Survey
Günther Charwat, Wolfgang Dvořák, Sarah Alice Gaggl, Johannes Peter Wallner, Stefan Woltran
Technical Report DBAI-TR-2013-82, Database and Artificial Intelligence Group, Vienna University of Technology, 2013 (link)
[16] ARVis: Visualizing Relations between Answer Sets
Thomas Ambroz, Günther Charwat, Andreas Jusits, Johannes Peter Wallner, Stefan Woltran
In Proceedings of the Twelfth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013), Pages 73-78, 2013 (DOI, system page, poster)
[15] Complexity of super-coherence problems in ASP
Mario Alviano, Wolfgang Faber, Stefan Woltran
In Theory and Practice of Logic Programming (TPLP), Volume 14, Issue 03, Pages 339-361, CUP, 2013 (paper at arXiv.org)

2012

[14] Utilizing ASP for Generating and Visualizing Argumentation Frameworks
Günther Charwat, Johannes Peter Wallner, Stefan Woltran
In Fifth Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2012), pages 51-65, 2012 (link)
[13] Decompose, Guess & Check:
Declarative Problem Solving on Tree Decompositions

Bernhard Bliem
Master's Thesis, Technische Universität Wien, Stefan Woltran and Reinhard Pichler advisors, 2012 (link)
[12] Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming
Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran
In Proceedings of the 6th International Conference on Learning and Intelligent Optimization (LION 2012), Pages 130-144, 2012 (link)
[11] D-FLAT: Declarative Problem Solving Using Tree Decompositions and Answer-Set Programming
Bernhard Bliem, Michael Morak, Stefan Woltran
In Theory and Practice of Logic Programming (TPLP), Volume 12, Special Issue 4-5, Pages 445-464, 2012 (link)
[10] Preprocessing of Complex Non-Ground Rules in Answer Set Programming
Michael Morak, Stefan Woltran
In Technical Communications of the 28th International Conference on Logic Programming (ICLP 2012), Pages 247-258, 2012 (link)
[9] Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough
Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran
In Theory and Practice of Logic Programming (TPLP), Pages 1-24, 2012 (paper at arXiv.org)
[8] Tree-decomposition based Algorithms for Abstract Argumentation Frameworks
Günther Charwat
Master's Thesis, Technische Universitšt Wien, Stefan Woltran and Wolfgang Dvořák advisors, 2012 (link)

2011

[7] Preprocessing of Complex Non-Ground Rules in Answer Set Programming
Michael Morak, Stefan Woltran
Technical Report DBAI-TR-2011-72, Database and Artificial Intelligence Group,
Vienna University of Technology (link)
[6] Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming
Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran
Technical Report DBAI-TR-2011-73, Database and Artificial Intelligence Group,
Vienna University of Technology (link)
[5] A New Tree-Decomposition Based Algorithm for Answer Set Programming
Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran
In Proceedings of the 23rd IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2011), Pages 916-918, 2011 (link)
[4] dynASP - A Dynamic-Programming Based Answer Set Programming Solver
Michael Morak, Master's Thesis, Vienna University of Technology, published January 2011 (thesis at obv, direct link)

2010

[3] A Dynamic-Programming Based ASP-Solver
Michael Morak, Reinhard Pichler, Stefan Rümmele, Stefan Woltran
In Proceedings of the 12th European Conference on Logics in Artificial Intelligence (JELIA 2010), LNCS, Volume 6341, Pages 369-372, 2010 (link)

Previous Publications

[2] Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough
Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran
In Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference (KR 2010), 2010. (paper at aaai.org)
[1] Answer-set programming with bounded treewidth
Michael Jakl, Reinhard Pichler, Stefan Woltran
In Proceedings of the 21st International Joint Conference on Artifical Intelligence (IJCAI 2009), Pages 816-822, 2009 (direct link, paper at ijcai.org)
Top
Last updated: 2012-03-12 17:47

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.