A compressed Generalized Hypertree Decomposition-based solving technique for non-binary Constraint Satisfaction Problems-Reference-Cited by-同舟云学术

A compressed Generalized Hypertree Decomposition-based solving technique for non-binary Constraint Satisfaction Problems

Published:2016-03-02 Issue:2 Volume:29 Page:371-392
ISSN:1875-8452
Container-title:AI Communications
language:
Short-container-title:AIC

Author:

Amroun Kamal¹,Habbas Zineb²,Aggoune-Mtalaa Wassila³

Affiliation:

1. LIMED, Faculté des Sciences Exactes, Université de Bejaia, 06000, Algeria. E-mail: k_amroun25@yahoo.fr

2. University of Lorraine, Metz, France

3. Luxembourg Institute of Science and Technology, Luxembourg

Publisher

IOS Press

Subject

Artificial Intelligence

Reference24 articles.

1. [1]I. Adler, G. Gottlob and M. Grohe, Hypertree-width and related hypergraph invariants, in: Proceedings of the 3rd European Conference on Combinatorics, Graph Theory, and Applications (EUROCOMB’05), DMTCS Proceedings Series, Vol. AE, 2005, pp. 5–10.

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

3. Power of natural semijoins;Bernstein;SIAM. J. Comput.,1981

4. Tree clustering for constraint networks;Dechter;Artificial Intelligence,1989

5. A sufficient condition for backtrack-bounded search;Freuder;Journal of the Association for Computing Machinery,1985

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

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

2. HSJ-Solver: a new method based on GHD for answering conjunctive queries and solving constraint satisfaction problems;Applied Intelligence;2022-12-27

3. Improving the Quality of Service Within Multi-objective Customer-Oriented Dial-A-Ride Problems;Lecture Notes on Data Engineering and Communications Technologies;2022-09-01

4. A Bi-objective Evolutionary Algorithm to Improve the Service Quality for On-Demand Mobility;Lecture Notes on Data Engineering and Communications Technologies;2022-09-01

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