Speeding up the ESG algorithm

Yousef Kilani, Abdullah Mohd. Zin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Local search (LS) methods heuristically find a solution for constraint satisfaction problems (CSP). LS starts the search for a solution from a random assignment. LS then examines the neighbours of this assignment to determine a better neighbour valuation to move to. It repeats this process of moving from the current assignment to a better assignment until it finds a solution that satisfies all constraints. ICM considers some of the constraints as hard constraints that are always satisfied. In this way, ICM reduces the possible neighbours in each move and hence the overall search space. ICM chooses the hard constraints in such away that the space of valuations that satisfies these constraints is connected in order to guarantee that a local search can reach any solution from any valuation in this space. In this paper, we incorporate ICM into one of the most recent local search algorithm, ESG, and we show the improvement of the new algorithm. We ran this algorithm in different SAT problems.

Original languageEnglish
Title of host publicationProceedings of the Eighteenth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2005 - Recent Advances in Artifical Intelligence
EditorsI. Russell, Z. Markov
Pages270-275
Number of pages6
Publication statusPublished - 2005
EventRecent Advances in Artifical Intelligence - Eighteenth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2005 - Clearwater Beach, FL
Duration: 15 May 200517 May 2005

Other

OtherRecent Advances in Artifical Intelligence - Eighteenth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2005
CityClearwater Beach, FL
Period15/5/0517/5/05

Fingerprint

Constraint satisfaction problems

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Kilani, Y., & Mohd. Zin, A. (2005). Speeding up the ESG algorithm. In I. Russell, & Z. Markov (Eds.), Proceedings of the Eighteenth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2005 - Recent Advances in Artifical Intelligence (pp. 270-275)

Speeding up the ESG algorithm. / Kilani, Yousef; Mohd. Zin, Abdullah.

Proceedings of the Eighteenth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2005 - Recent Advances in Artifical Intelligence. ed. / I. Russell; Z. Markov. 2005. p. 270-275.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kilani, Y & Mohd. Zin, A 2005, Speeding up the ESG algorithm. in I Russell & Z Markov (eds), Proceedings of the Eighteenth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2005 - Recent Advances in Artifical Intelligence. pp. 270-275, Recent Advances in Artifical Intelligence - Eighteenth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2005, Clearwater Beach, FL, 15/5/05.
Kilani Y, Mohd. Zin A. Speeding up the ESG algorithm. In Russell I, Markov Z, editors, Proceedings of the Eighteenth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2005 - Recent Advances in Artifical Intelligence. 2005. p. 270-275
Kilani, Yousef ; Mohd. Zin, Abdullah. / Speeding up the ESG algorithm. Proceedings of the Eighteenth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2005 - Recent Advances in Artifical Intelligence. editor / I. Russell ; Z. Markov. 2005. pp. 270-275
@inproceedings{8b09674410cf487b83d49c7fc58a4178,
title = "Speeding up the ESG algorithm",
abstract = "Local search (LS) methods heuristically find a solution for constraint satisfaction problems (CSP). LS starts the search for a solution from a random assignment. LS then examines the neighbours of this assignment to determine a better neighbour valuation to move to. It repeats this process of moving from the current assignment to a better assignment until it finds a solution that satisfies all constraints. ICM considers some of the constraints as hard constraints that are always satisfied. In this way, ICM reduces the possible neighbours in each move and hence the overall search space. ICM chooses the hard constraints in such away that the space of valuations that satisfies these constraints is connected in order to guarantee that a local search can reach any solution from any valuation in this space. In this paper, we incorporate ICM into one of the most recent local search algorithm, ESG, and we show the improvement of the new algorithm. We ran this algorithm in different SAT problems.",
author = "Yousef Kilani and {Mohd. Zin}, Abdullah",
year = "2005",
language = "English",
isbn = "1577352343",
pages = "270--275",
editor = "I. Russell and Z. Markov",
booktitle = "Proceedings of the Eighteenth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2005 - Recent Advances in Artifical Intelligence",

}

TY - GEN

T1 - Speeding up the ESG algorithm

AU - Kilani, Yousef

AU - Mohd. Zin, Abdullah

PY - 2005

Y1 - 2005

N2 - Local search (LS) methods heuristically find a solution for constraint satisfaction problems (CSP). LS starts the search for a solution from a random assignment. LS then examines the neighbours of this assignment to determine a better neighbour valuation to move to. It repeats this process of moving from the current assignment to a better assignment until it finds a solution that satisfies all constraints. ICM considers some of the constraints as hard constraints that are always satisfied. In this way, ICM reduces the possible neighbours in each move and hence the overall search space. ICM chooses the hard constraints in such away that the space of valuations that satisfies these constraints is connected in order to guarantee that a local search can reach any solution from any valuation in this space. In this paper, we incorporate ICM into one of the most recent local search algorithm, ESG, and we show the improvement of the new algorithm. We ran this algorithm in different SAT problems.

AB - Local search (LS) methods heuristically find a solution for constraint satisfaction problems (CSP). LS starts the search for a solution from a random assignment. LS then examines the neighbours of this assignment to determine a better neighbour valuation to move to. It repeats this process of moving from the current assignment to a better assignment until it finds a solution that satisfies all constraints. ICM considers some of the constraints as hard constraints that are always satisfied. In this way, ICM reduces the possible neighbours in each move and hence the overall search space. ICM chooses the hard constraints in such away that the space of valuations that satisfies these constraints is connected in order to guarantee that a local search can reach any solution from any valuation in this space. In this paper, we incorporate ICM into one of the most recent local search algorithm, ESG, and we show the improvement of the new algorithm. We ran this algorithm in different SAT problems.

UR - http://www.scopus.com/inward/record.url?scp=32844465009&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=32844465009&partnerID=8YFLogxK

M3 - Conference contribution

SN - 1577352343

SP - 270

EP - 275

BT - Proceedings of the Eighteenth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2005 - Recent Advances in Artifical Intelligence

A2 - Russell, I.

A2 - Markov, Z.

ER -