论文信息 - Dynamic Programming on Tree Decompositions with D-FLAT

Dynamic Programming on Tree Decompositions with D-FLAT

Many hard problems can be solved efficiently by dynamic programming algorithms that work on tree decompositions. In this paper, we present the D-FLAT system for rapid prototyping of such algorithms. Users can specify the algorithm for their problem using Answer Set Programming. We illustrate the framework by an example and briefly discuss its main features.

[1] Paul D. Seymour,et al. Graph minors. III. Planar tree-width , 1984, J. Comb. Theory B.

[2] Rolf Niedermeier,et al. INTRODUCTION TO FIXED-PARAMETER ALGORITHMS , 2006 .

[3] Dimitrios M. Thilikos,et al. Invitation to fixed-parameter algorithms , 2007, Comput. Sci. Rev..

[4] Stefan Woltran,et al. Implementing Courcelle's Theorem in a declarative framework for dynamic programming , 2016, Journal of Logic and Computation.

[5] S. Woltran,et al. D-FLATˆ 2 : Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy DBAI-TR-2015-93 , 2015 .

[6] Rolf Niedermeier,et al. Invitation to Fixed-Parameter Algorithms , 2006 .

[7] Stefan Woltran,et al. The D-FLAT System for Dynamic Programming on Tree Decompositions , 2014, JELIA.

[8] Stefan Woltran,et al. The D-FLAT System : User Manual , 2017 .

[9] Stefan Woltran,et al. ASP for Anytime Dynamic Programming on Tree Decompositions , 2016, IJCAI.