The D-FLAT System for Dynamic Programming on Tree Decompositions

被引：0
|
作者：
Abseher, Michael [1 ]
Bliem, Bernhard [1 ]
Charwat, Guenther [1 ]
Dusberger, Frederico [1 ]
Hecher, Markus [1 ]
Woltran, Stefan [1 ]
机构：
[1] Vienna Univ Technol, Inst Informat Syst 184 2, A-1040 Vienna, Austria
来源：
LOGICS IN ARTIFICIAL INTELLIGENCE, JELIA 2014 | 2014年 / 8761卷
基金：
奥地利科学基金会;
关键词：
Answer Set Programming; tree decompositions; treewidth;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Complex reasoning problems over large amounts of data pose a great challenge for computer science. To overcome the obstacle of high computational complexity, exploiting structure by means of tree decompositions has proved to be effective in many cases. However, the implementation of suitable efficient algorithms is often tedious. D-FLAT is a software system that combines the logic programming language Answer Set Programming with problem solving on tree decompositions and can serve as a rapid prototyping tool for such algorithms. Since we initially proposed D-FLAT, we have made major changes to the system, improving its range of applicability and its usability. In this paper, we present the system resulting from these efforts.
引用
收藏
页码：558 / 572
页数：15
相关论文
共 50 条
  • [1] The D-FLAT system for dynamic programming on tree decompositions
    Abseher, Michael
    Bliem, Bernhard
    Charwat, Günther
    Dusberger, Frederico
    Hecher, Markus
    Woltran, Stefan
    [J]. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8761 : 558 - 572
  • [2] Dynamic Programming on Tree Decompositions with D-FLAT
    Abseher, Michael
    Bliem, Bernhard
    Hecher, Markus
    Moldovan, Marius
    Woltran, Stefan
    [J]. KUNSTLICHE INTELLIGENZ, 2018, 32 (2-3): : 191 - 192
  • [3] D-FLAT: Declarative problem solving using tree decompositions and answer-set programming
    Bliem, Bernhard
    Morak, Michael
    Woltran, Stefan
    [J]. THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2012, 12 : 445 - 464
  • [4] C-PROGRAMMING - D-FLAT
    STEVENS, A
    [J]. DR DOBBS JOURNAL, 1991, 16 (05): : 115 - &
  • [5] D-FLAT2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy
    Bliem, Bernhard
    Charwat, Gunther
    Hecher, Markus
    Woltran, Stefan
    [J]. FUNDAMENTA INFORMATICAE, 2016, 147 (01) : 27 - 61
  • [6] THE D-FLAT MENU SYSTEM
    STEVENS, A
    [J]. DR DOBBS JOURNAL, 1992, 17 (04): : 121 - &
  • [7] D-FLAT LISTS AND LOGS
    STEVENS, A
    [J]. DR DOBBS JOURNAL, 1992, 17 (03): : 105 - &
  • [8] A guatemalan rhapsody in D-flat
    Lutwick, LI
    Lamoste, T
    Chapnick, EK
    [J]. INFECTIONS IN MEDICINE, 1997, 14 (12) : 928 - +
  • [9] D-FLAT CONTINUED
    STEVENS, A
    [J]. DR DOBBS JOURNAL, 1991, 16 (06): : 123 - &
  • [10] COMPARING D-FLAT AND D-FLAT++
    STEVENS, A
    [J]. DR DOBBS JOURNAL, 1993, 18 (02): : 111 - +
12345