loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Abdelmalek Ait-Amokhtar 1 ; Kamal Amroun 1 and Zineb Habbas 2

Affiliations: 1 University of Bejaia, Algeria ; 2 LITA, France

ISBN: 978-989-8111-66-1

Keyword(s): CSP, Structural decompositions, Hypertree decomposition, Acyclic Solving algorithm, Enumerative search.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Artificial Intelligence and Decision Support Systems ; Computational Intelligence ; Constraint Satisfaction ; Enterprise Information Systems ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Soft Computing ; Symbolic Systems

Abstract: This paper deals with the structural decomposition methods and their use for solving Constraint Satisfaction problems (CSP). mong the numerous structural decomposition methods, hypertree decomposition has been shown to be the most general CSP decomposition. However so far the exact methods are not able to find optimal decomposition of realistic instances in a reasonable CPU time. We present Alea, a new heuristic to compute hypertree decomposition. Some experiments on a serial of benchmarks coming from the literature or the industry permit us to observe that Alea is in general better or comparable to BE (Bucket Elimination), the best well known heuristic, while it generally outperforms DBE (Dual Bucket Elimination), another successful heuristic. We also experiment an algorithm (acyclic solving algorithm) for solving an acyclic CSP obtained by using the heuristic Alea. The experimental results we obtain are promising comparing to those obtained by solving CSP using an enumerative search algorithm. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.229.122.219

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Ait-Amokhtar A.; Amroun K.; Habbas Z. and (2009). HYPERTREE DECOMPOSITION FOR SOLVING CONSTRAINT SATISFACTION PROBLEMS.In Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-8111-66-1, pages 85-92. DOI: 10.5220/0001662400850092

@conference{icaart09,
author={Abdelmalek Ait{-}Amokhtar and Kamal Amroun and Zineb Habbas},
title={HYPERTREE DECOMPOSITION FOR SOLVING CONSTRAINT SATISFACTION PROBLEMS},
booktitle={Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2009},
pages={85-92},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001662400850092},
isbn={978-989-8111-66-1},
}

TY - CONF

JO - Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - HYPERTREE DECOMPOSITION FOR SOLVING CONSTRAINT SATISFACTION PROBLEMS
SN - 978-989-8111-66-1
AU - Ait-Amokhtar, A.
AU - Amroun, K.
AU - Habbas, Z.
PY - 2009
SP - 85
EP - 92
DO - 10.5220/0001662400850092

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.