版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Univ Helsinki Gustaf Hallstromin Katu 2b Helsinki 00560 Finland TU Wien Favoritenstr 9-11 A-1040 Vienna Austria
出 版 物:《KUNSTLICHE INTELLIGENZ》 (人工智能)
年 卷 期:2018年第32卷第2-3期
页 面:191-192页
核心收录:
学科分类:08[工学] 0812[工学-计算机科学与技术(可授工学、理学学位)]
基 金:Austrian Science Fund (FWF) [P25607 Y698]
主 题:Tree decomposition Answer set programming Dynamic programming
摘 要: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.