A unified theory of structural tractability for constraint satisfaction problems-Reference-Cited by-同舟云学术

A unified theory of structural tractability for constraint satisfaction problems

Published:2008-08 Issue:5 Volume:74 Page:721-743
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Cohen David,Jeavons Peter,Gyssens Marc

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference18 articles.

1. Marshals, monotone marshals, and hypertree-width;Adler;J. Graph Theory,2004

2. Hypertree-width and related hypergraph invariants;Adler,2005

3. On the desirability of acyclic database schemes;Beeri;J. ACM,1983

4. Conjunctive query containment revisited;Chekuri;Theoret. Comput. Sci.,2000

5. D. Cohen, M. Gyssens, P. Jeavons, A unified theory of structural tractability for constraint satisfaction and spread cut decomposition, in: Proceedings of IJCAI '05, 2005

Cited by 53 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fast and parallel decomposition of constraint satisfaction problems;Constraints;2022-06-03

2. Complexity Analysis of Generalized and Fractional Hypertree Decompositions;Journal of the ACM;2021-10-31

3. Chapter 17. Fixed-Parameter Tractability;Frontiers in Artificial Intelligence and Applications;2021-02-02

4. Soft Directional Substitutable based Decompositions for MOVCSP;Proceedings of the 10th International Conference on Operations Research and Enterprise Systems;2021

5. The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2020