By Topic

DH_FFP and RANK_FFP: Solving Constraint Satisfaction Problems Via Ordering the Domain Values

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ji-gui Sun ; College of Computer Science and Technology, Jilin University, Changchun, China, 130012; Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, China, 130012. E-MAIL: ; Tian Liang ; Qing-yun Yang ; Ming-hao Yin

Fail First Principle (FFP) is a general heuristic algorithm (for solving constraint satisfaction problems) considering the order of variables. However, FFP neglects the order of values in domains. In this paper, we describe two algorithms, DH_FFP and Rank_FFP based on FFP. DH_FFP partitions a domain recursively with the middle value after choosing the variable that has the smallest domain. Rank_FFP makes use of the heuristic information between variables and constraints, evaluating and ranking every partition of a domain. We implemented these two algorithms and embedded into the constraint solving platform "Ming Yue SOLVER 1.0" designed by us. The experimental results show that both DH_FFP and Rank_FFP enhance FFP to much extent on both solving efficiency and size

Published in:

2006 International Conference on Machine Learning and Cybernetics

Date of Conference:

13-16 Aug. 2006