Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
A Tree-Decomposition Approach to Protein Structure Prediction
CSB '05 Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Simplifying dynamic programming via mode-directed tabling
Software—Practice & Experience
Heuristic Methods for Hypertree Decomposition
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Algorithms for propositional model counting
Journal of Discrete Algorithms
Answer-set programming with bounded treewidth
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Treewidth computations I. Upper bounds
Information and Computation
Monadic datalog over finite structures of bounded treewidth
ACM Transactions on Computational Logic (TOCL)
Structural tractability of enumerating CSP solutions
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Potassco: The Potsdam Answer Set Solving Collection
AI Communications - Answer Set Programming
An incremental answer set programming based system for finite model computation
AI Communications - Answer Set Programming
Reactive answer set programming
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Answer set programming at a glance
Communications of the ACM
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Parameterized Complexity and Biopolymer Sequence Comparison
The Computer Journal
Combinatorial Optimization on Graphs of Bounded Treewidth
The Computer Journal
Hi-index | 0.00 |
In this work, we propose Answer-Set Programming (ASP) as a tool for rapid prototyping of dynamic programming algorithms based on tree decompositions. In fact, many such algorithms have been designed, but only a few of them found their way into implementation. The main obstacle is the lack of easy-to-use systems which (i) take care of building a tree decomposition and (ii) provide an interface for declarative specifications of dynamic programming algorithms. In this paper, we present D-FLAT, a novel tool that relieves the user of having to handle all the technical details concerned with parsing, tree decomposition, the handling of data structures, etc. Instead, it is only the dynamic programming algorithm itself which has to be specified in the ASP language. D-FLAT employs an ASP solver in order to compute the local solutions in the dynamic programming algorithm. In the paper, we give a few examples illustrating the use of D-FLAT and describe the main features of the system. Moreover, we report experiments which show that ASP-based D-FLAT encodings for some problems outperform monolithic ASP encodings on instances of small treewidth.