Graph minors. V. Excluding a planar graph
Journal of Combinatorial Theory Series B
Solving queries by tree projections
ACM Transactions on Database Systems (TODS)
A comparison of structural CSP decomposition methods
Artificial Intelligence
When is the evaluation of conjunctive queries tractable?
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
Journal of Computer and System Sciences - Special issu on PODS 2001
Constraint solving via fractional edge covers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Tree-Related Widths of Graphs and Hypergraphs
SIAM Journal on Discrete Mathematics
A unified theory of structural tractability for constraint satisfaction problems
Journal of Computer and System Sciences
Approximating fractional hypertree width
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Uniform Constraint Satisfaction Problems and Database Theory
Complexity of Constraints
Generalized hypertree decompositions: NP-hardness and tractable variants
Journal of the ACM (JACM)
Tractable hypergraph properties for constraint satisfaction and conjunctive queries
Proceedings of the forty-second ACM symposium on Theory of computing
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Structural tractability of constraint optimization
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Journal of Computer and System Sciences
D-flat: Declarative problem solving using tree decompositions and answer-set programming
Theory and Practice of Logic Programming
Structural tractability of counting of solutions to conjunctive queries
Proceedings of the 16th International Conference on Database Theory
Tractable counting of the answers to conjunctive queries
Journal of Computer and System Sciences
Static analysis and optimization of semantic web queries
ACM Transactions on Database Systems (TODS) - Invited papers issue
Hi-index | 0.00 |
The problem of deciding whether CSP instances admit solutions has been deeply studied in the literature, and several structural tractability results have been derived so far. However, constraint satisfaction comes in practice as a computation problem where the focus is either on finding one solution, or on enumerating all solutions, possibly projected over some given set of output variables. The paper investigates the structural tractability of the problem of enumerating (possibly projected) solutions, where tractability means here computable with polynomial delay (WPD), since in general exponentially many solutions may be computed. A general framework based on the notion of tree projection of hypergraphs is considered, which generalizes all known decomposition methods. Tractability results have been obtained both for classes of structures where output variables are part of their specification, and for classes of structures where computability WPD must be ensured for any possible set of output variables. These results are shown to be tight, by exhibiting dichotomies for classes of structures having bounded arity and where the tree decomposition method is considered.