A NEW METHOD FOR SOLVING CONSTRAINT SATISFACTION PROBLEMS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

GHASEM SANI GH.R.; NAMAZI M.

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: ESTEGHLAL Year:2004 | Volume:23 | Issue:1 Page(s): 1-14

Download Full-Text

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

View:

3,209

Download:

Cites:

Information Journal Paper

Title

A NEW METHOD FOR SOLVING CONSTRAINT SATISFACTION PROBLEMS

Author(s)

GHASEM SANI GH.R. | NAMAZI M. | Issue Writer Certificate

Keywords

ARTIFICIAL INTELLLGENCEQ3

SEARCHQ4

CONSTRAINT SAJISFACTION PROBLEMSQ4

CONSISTENT LABELING PROBLEMSQ4

Abstract

Many Important problems In Artificial Intelligence can be defined as Constralnt Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constralnts on the values of those variables (these problems are also called Consistent Labelling Problems (CLP), in which "Labeling" nuans assigning a value to a variable.) Solution to these problems is a set of unique values for variables such that all the problem constralnts are satisfied. Several SEARCH algorithms have been proposed for solving these problems, som of which reduce the need for bacJctracklng by doing some sort of looking to future, and produce more efficient solutions. These are the so-called Forward Checking (FC), Partialiy Lookahead (PL), and Fully Lookahead (FL) algorithms. They are different In terms of the amount of looking to the future, number of backtracks thaJ are performed, and the quality of the solution that they find. In this paper, wepropose a new SEARCH algorithm we call Modified Fully Lookahead (MFL) which is Shown to be more efficient than the original Fully Lookahead algorithm

Cites

No record.

References

No record.

Cite

APA: Copy

GHASEM SANI, GH.R., & NAMAZI, M.. (2004). A NEW METHOD FOR SOLVING CONSTRAINT SATISFACTION PROBLEMS. ESTEGHLAL, 23(1), 1-14. SID. https://sid.ir/paper/5993/en

Vancouver: Copy

GHASEM SANI GH.R., NAMAZI M.. A NEW METHOD FOR SOLVING CONSTRAINT SATISFACTION PROBLEMS. ESTEGHLAL[Internet]. 2004;23(1):1-14. Available from: https://sid.ir/paper/5993/en

IEEE: Copy

GH.R. GHASEM SANI, and M. NAMAZI, “A NEW METHOD FOR SOLVING CONSTRAINT SATISFACTION PROBLEMS,” ESTEGHLAL, vol. 23, no. 1, pp. 1–14, 2004, [Online]. Available: https://sid.ir/paper/5993/en

Related Journal Papers