D-FLAT: Declarative problem solving using tree decompositions and answer-set programming

DOI10.1017/S1471068412000129zbMath1260.68057arXiv1210.1931MaRDI QIDQ4911127

Michael Morak, Stefan Woltran, Bernhard Bliem

Publication date: 13 March 2013

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.1931

zbMATH Keywords

dynamic programming algorithmsD-FLAT encoding

Mathematics Subject Classification ID

Dynamic programming (90C39) Logic programming (68N17)

Related Items (3)

Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams ⋮ Redundant Sudoku rules ⋮ Methods for solving reasoning problems in abstract argumentation -- a survey

Uses Software

• oClingo
• D-FLAT

Cites Work

• Hypertree decompositions and tractable queries
• Graph minors. III. Planar tree-width
• Treewidth computations. I: Upper bounds
• Logic programs with stable model semantics as a constraint programming paradigm
• Algorithms for propositional model counting
• Monadic datalog over finite structures of bounded treewidth
• Solving partial constraint satisfaction problems with tree decomposition
• The DLV system for knowledge representation and reasoning

This page was built for publication: D-FLAT: Declarative problem solving using tree decompositions and answer-set programming