ScholarLens Back to search
2008•Unpublished venueRequires access

Improving the Efficiency of Forward Checking Algorithm for Solving Constraint Satisfaction Problems

Yousef Farhang, M. R. Meybodi, Abdolreza Hatamlou

Open publisher page 1 citations

Abstract

There are various problems concerning artificial intelligence which can be stated in the from of constraint satisfaction problems (CSP). These problems are defined by a set of variables and a set of constraints in the range of selectable values for variables. Solution of this problem is a set of values for variables so that all constraints of the problem are satisfied. A part of algorithms for CSP are forward algorithms. They are used to check consistency and constraint propagation. The most famous forward algorithm, is forward checking algorithm (FCA). In this article we are going to introduce FCA and suggest two algorithms to improve efficiency of forward.

About this research paper

What this paper is about

There are various problems concerning artificial intelligence which can be stated in the from of constraint satisfaction problems (CSP). These problems are defined by a set of variables and a set of constraints in the range of selectable values for variables. Solution of this problem is a set of values for variables so that all constraints of the problem are satisfied. A part of algorithms for CSP are forward algorithms. They are used to check consistency and constraint propagation. The most famous forward algorithm, is forward checking algorithm (FCA). In this article we are going to introduce FCA and suggest two algorithms to improve efficiency of forward.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

There are various problems concerning artificial intelligence which can be stated in the from of constraint satisfaction problems (CSP). These problems are defined by a set of variables and a set of constraints in the range of selectable values for variables. Solution of this problem is a set of values for variables so that all constraints of the problem are satisfied. A part of algorithms for CSP are forward algorithms. They are used to check consistency and constraint propagation. The most famous forward algorithm, is forward checking algorithm (FCA). In this article we are going to introduce FCA and suggest two algorithms to improve efficiency of forward.

Key concepts: Local consistency, Constraint satisfaction problem, Constraint satisfaction, Constraint satisfaction dual problem, Consistency (knowledge bases), Constraint (computer-aided design), Set (abstract data type), Computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Improving the Efficiency of Forward Checking Algorithm for Solving Constraint Satisfaction Problems — Research Paper | ScholarLens