D-FLAT: Declarative problem solving using tree decompositions and answer-set programming (Q4911127): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.1931
@@ Property / arXiv ID: 1210.1931 / rank @@
+Normal rank
@@ Property / cites work @@
+Hypertree decompositions and tractable queries
@@ Property / cites work: Hypertree decompositions and tractable queries / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth computations. I: Upper bounds
@@ Property / cites work: Treewidth computations. I: Upper bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for propositional model counting
@@ Property / cites work: Algorithms for propositional model counting / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Logic programs with stable model semantics as a constraint programming paradigm
+Normal rank
@@ Property / cites work @@
+The DLV system for knowledge representation and reasoning
+Normal rank
@@ Property / cites work @@
+Solving partial constraint satisfaction problems with tree decomposition
+Normal rank
@@ Property / cites work @@
+Monadic datalog over finite structures of bounded treewidth
+Normal rank