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

 Speed and Vibration Performance as well as Obstacle Avoidance Performance of Electric Wheel Chair Controlled by Human Eyes Only

 Speed and vibration performance as well as obstacle avoidance performance of the previously proposed Electric Wheel Chair: EWC controlled by human eyes only is conducted. Experimental results show acceptable perfor...

Measures for Testing the Reactivity Property of a Software Agent

Agent technology is meant for developing complex distributed applications. Software agents are the key building blocks of a Multi-Agent System (MAS). Software agents are unique in its nature as it possesses certain disti...

CASE STUDY ON EFFECTIVENESS EVALUATION OF BUISINESS PROCEDURE REENGINEERING: BPR FOR LOCAL GOVERNMENT IN SAGA PREFECTURE, JAPAN

Case study on validation of effeteness of Business Procedure Reengineering: BPR for local government in Saga prefecture, Japan is conducted. As the results, if it found that BPR is effective. The local government, enviro...

 Developing a Mathematical Model to Detect Diabetes Using Multigene Genetic Programming

 Diabetes Mellitus is one of the deadly diseases growing at a rapid rate in the developing countries. Diabetes Mellitus is being one of the major contributors to the mortality rate. It is the sixth reason for death...

 Regressive Analysis on Leaf Nitrogen Content and Near Infrared Reflectance and Its Application for Agricultural Farm Monitoring with Helicopter Mounted Near Infrared Camera

 Method for evaluation of nitrogen richness of tealeaves with near infrared reflectance is proposed. Also tea farm monitoring with helicopter mounted near infrared camera is proposed. Through experiments and regress...

Download PDF file
  • EP ID EP103684
  • DOI -
  • Views 121
  • 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