A Forward-Checking algorithm based on a Generalised Hypertree Decomposition for solving non-binary constraint satisfaction problems-Reference-Cited by-同舟云学术

A Forward-Checking algorithm based on a Generalised Hypertree Decomposition for solving non-binary constraint satisfaction problems

Published:2015-04-21 Issue:5 Volume:27 Page:649-671
ISSN:0952-813X
Container-title:Journal of Experimental & Theoretical Artificial Intelligence
language:en
Short-container-title:Journal of Experimental & Theoretical Artificial Intelligence

Author:

Habbas Zineb,Amroun Kamal,Singer Daniel

Publisher

Informa UK Limited

Subject

Artificial Intelligence,Theoretical Computer Science,Software

Link

http://www.tandfonline.com/doi/pdf/10.1080/0952813X.2014.993507

Reference29 articles.

1. AdlerI., GottlobG. & GroheM. (2005, September 5–9). Hypertree-width and related hypergraph invariants. In Proceedings of the 3rd European conference on combinatorics, graph theory, and applications (EUROCOMB’05), DMTCS proceedings series, Berlin (Vol. AE, pp. 5–10).

2. On the Desirability of Acyclic Database Schemes

3. Power of Natural Semijoins

4. A unified theory of structural tractability for constraint satisfaction problems

5. Tree clustering for constraint networks

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

1. Incremental Updates of Generalized Hypertree Decompositions;ACM Journal of Experimental Algorithmics;2022-12-31

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

3. HyperBench;ACM Journal of Experimental Algorithmics;2021-12-31

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

5. HyperBench;Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS '19;2019