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
New sub-project webpages online
05.03.2012The webpages for dynASP and D-FLAT are now online.
TopProject 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.
The goal of this project is twofold:
- It 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 (see dynASP).
- Additionally, it focuses the development of a framework that provides an interface for declarative specifications of dynamic programming algorithms. An algorithm developer only has to specify the algorithm itself in the ASP language and the framework takes care of parsing, tree decompostions and handling data structures (see D-FLAT).
Project Team
Project Staff:
Project Partners:
TopSoftware
- dynASP: A Dynamic Programming-based Answer Set Programming Solver.
- D-FLAT: A framework for rapid development of ASP-encoded algorithms that are based on tree decompositions and dynamic programming.
Publications
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 Lecture Notes in Computer Science, Volume 6341, 2010, Pages 369-372, ISBN 978-3-642-15674-8, DOI: 10.1007/978-3-642-15675-5_34 (paper at SpringerLink) |
Previous Publications | |
| [2] |
Tractable Answer-Set Programming with Weight Constraints:
Bounded Treewidth Is not Enough Reinhard Pichler, Stefan Rümmele, Stefan Szeiler, 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) |
Last updated: 2012-03-12 17:47