Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
