LSVF: a New Search Heuristic to Reduce the Backtracking Calls for Solving Constraint Satisfaction Problem

Abstract

Many researchers in Artificial Intelligence seek for new algorithms to reduce the amount of memory/ time consumed for general searches in Constraint Satisfaction Problems. These improvements are accomplished by the use of heuristics which either prune useless tree search branches or even indicate the path to reach the (optimal) solution faster than the blind version of the search. Many heuristics were proposed in the literature, like the Least Constraining Value (LCV). In this paper we propose a new pre-processing search heuristic to reduce the amount of backtracking calls, namely the Least Suggested Value First: a solution whenever the LCV solely cannot measure how much a value is constrained. In this paper, we present a pedagogical example, as well as the preliminary results.

Authors and Affiliations

Ryan Ribeiro de Azevedo , Cleyton Rodrigues , Fred Freitas , Eric Dantas

Keywords

Related Articles

 3D Map Creation Based on Knowledgebase System for Texture Mapping Together with Height Estimation Using Objects’ Shadows with High Spatial Resolution Remote Sensing Satellite Imagery Data

 Method for 3D map creation based on knowledgebase system for texture mapping together with height estimation using objects’ shadows with high spatial resolution of remote sensing satellite imagery data is proposed....

 Proposal of Tabu Search Algorithm Based on Cuckoo Search

 This paper presents a new version of Tabu Search (TS) based on Cuckoo Search (CS) called (Tabu-Cuckoo Search TCS) to reduce the effect of the TS problems. The proposed algorithm provides a more diversity to candida...

 Cogntive Consistency Analysis in Adaptive Bio-Metric Authentication System Design

 Cognitive consistency analysis aims to continuously monitor one's perception equilibrium towards successful accomplishment of cognitive task. Opposite to cognitive flexibility analysis – cognitive consistency analy...

 Thresholding Based Method for Rainy Cloud Detection with NOAA/AVHRR Data by Means of Jacobi Itteration Method

 Thresholding based method for rainy cloud detection with NOAA/AVHRR data by means of Jacobi iteration method is proposed. Attempts of the proposed method are made through comparisons to truth data which are provide...

 Relative Motion of Formation Flying with Elliptical Reference Orbit

 In this paper we present the optimal control of the relative motion of formation flying consisting of two spacecrafts. One of the spacecraft is considered as the chief, orbiting the Earth on a Highly Elliptical Orb...

Download PDF file
  • EP ID EP103684
  • DOI -
  • Views 133
  • Downloads 0

How To Cite

Ryan Ribeiro de Azevedo, Cleyton Rodrigues, Fred Freitas, Eric Dantas (2012). LSVF: a New Search Heuristic to Reduce the Backtracking Calls for Solving Constraint Satisfaction Problem. International Journal of Advanced Research in Artificial Intelligence(IJARAI), 1(9), 20-25. https://europub.co.uk./articles/-A-103684