Weak-commitment search for solving constraint satisfaction problems

Research output: Contribution to conferencePaper

46 Citations (Scopus)

Abstract

The min-conflict heuristic (Minton et al. 1992) has been introduced into backtracking algorithms and iterative improvement algorithms as a powerful heuristic for solving constraint satisfaction problems. Backtracking algorithms become inefficient when a bad partial solution is constructed, since an exhaustive search is required for revising the bad decision. On the other hand, iterative improvement algorithms do not construct a consistent partial solution and can revise a bad decision without exhaustive search. However, most of the powerful heuristics obtained through the long history of constraint satisfaction studies (e.g., forward checking (Haralick & Elliot 1980)) presuppose the existence of a consistent partial solution. Therefore, these heuristics can not be applied to iterative improvement algorithms. Furthermore, these algorithms are not theoretically complete. In this paper, a new algorithm called weak-commitment search which utilizes the min-conflict heuristic is developed. This algorithm removes the drawbacks of backtracking algorithms and iterative improvement algorithms, i.e., the algorithm can revise bad decisions without exhaustive search, the completeness of the algorithm is guaranteed, and various heuristics can be introduced since a consistent partial solution is constructed. The experimental results on various example problems show that this algorithm is 3 to 10 times more efficient than other algorithms.

Original languageEnglish
Pages313-318
Number of pages6
Publication statusPublished - Dec 1 1994
Externally publishedYes
EventProceedings of the 12th National Conference on Artificial Intelligence. Part 1 (of 2) - Seattle, WA, USA
Duration: Jul 31 1994Aug 4 1994

Other

OtherProceedings of the 12th National Conference on Artificial Intelligence. Part 1 (of 2)
CitySeattle, WA, USA
Period7/31/948/4/94

Fingerprint

Constraint satisfaction problems

All Science Journal Classification (ASJC) codes

  • Software
  • Artificial Intelligence

Cite this

Yokoo, M. (1994). Weak-commitment search for solving constraint satisfaction problems. 313-318. Paper presented at Proceedings of the 12th National Conference on Artificial Intelligence. Part 1 (of 2), Seattle, WA, USA, .

Weak-commitment search for solving constraint satisfaction problems. / Yokoo, Makoto.

1994. 313-318 Paper presented at Proceedings of the 12th National Conference on Artificial Intelligence. Part 1 (of 2), Seattle, WA, USA, .

Research output: Contribution to conferencePaper

Yokoo, M 1994, 'Weak-commitment search for solving constraint satisfaction problems', Paper presented at Proceedings of the 12th National Conference on Artificial Intelligence. Part 1 (of 2), Seattle, WA, USA, 7/31/94 - 8/4/94 pp. 313-318.
Yokoo M. Weak-commitment search for solving constraint satisfaction problems. 1994. Paper presented at Proceedings of the 12th National Conference on Artificial Intelligence. Part 1 (of 2), Seattle, WA, USA, .
Yokoo, Makoto. / Weak-commitment search for solving constraint satisfaction problems. Paper presented at Proceedings of the 12th National Conference on Artificial Intelligence. Part 1 (of 2), Seattle, WA, USA, .6 p.
@conference{8a5ea2f7b1294f77a0783a14b5f08ec5,
title = "Weak-commitment search for solving constraint satisfaction problems",
abstract = "The min-conflict heuristic (Minton et al. 1992) has been introduced into backtracking algorithms and iterative improvement algorithms as a powerful heuristic for solving constraint satisfaction problems. Backtracking algorithms become inefficient when a bad partial solution is constructed, since an exhaustive search is required for revising the bad decision. On the other hand, iterative improvement algorithms do not construct a consistent partial solution and can revise a bad decision without exhaustive search. However, most of the powerful heuristics obtained through the long history of constraint satisfaction studies (e.g., forward checking (Haralick & Elliot 1980)) presuppose the existence of a consistent partial solution. Therefore, these heuristics can not be applied to iterative improvement algorithms. Furthermore, these algorithms are not theoretically complete. In this paper, a new algorithm called weak-commitment search which utilizes the min-conflict heuristic is developed. This algorithm removes the drawbacks of backtracking algorithms and iterative improvement algorithms, i.e., the algorithm can revise bad decisions without exhaustive search, the completeness of the algorithm is guaranteed, and various heuristics can be introduced since a consistent partial solution is constructed. The experimental results on various example problems show that this algorithm is 3 to 10 times more efficient than other algorithms.",
author = "Makoto Yokoo",
year = "1994",
month = "12",
day = "1",
language = "English",
pages = "313--318",
note = "Proceedings of the 12th National Conference on Artificial Intelligence. Part 1 (of 2) ; Conference date: 31-07-1994 Through 04-08-1994",

}

TY - CONF

T1 - Weak-commitment search for solving constraint satisfaction problems

AU - Yokoo, Makoto

PY - 1994/12/1

Y1 - 1994/12/1

N2 - The min-conflict heuristic (Minton et al. 1992) has been introduced into backtracking algorithms and iterative improvement algorithms as a powerful heuristic for solving constraint satisfaction problems. Backtracking algorithms become inefficient when a bad partial solution is constructed, since an exhaustive search is required for revising the bad decision. On the other hand, iterative improvement algorithms do not construct a consistent partial solution and can revise a bad decision without exhaustive search. However, most of the powerful heuristics obtained through the long history of constraint satisfaction studies (e.g., forward checking (Haralick & Elliot 1980)) presuppose the existence of a consistent partial solution. Therefore, these heuristics can not be applied to iterative improvement algorithms. Furthermore, these algorithms are not theoretically complete. In this paper, a new algorithm called weak-commitment search which utilizes the min-conflict heuristic is developed. This algorithm removes the drawbacks of backtracking algorithms and iterative improvement algorithms, i.e., the algorithm can revise bad decisions without exhaustive search, the completeness of the algorithm is guaranteed, and various heuristics can be introduced since a consistent partial solution is constructed. The experimental results on various example problems show that this algorithm is 3 to 10 times more efficient than other algorithms.

AB - The min-conflict heuristic (Minton et al. 1992) has been introduced into backtracking algorithms and iterative improvement algorithms as a powerful heuristic for solving constraint satisfaction problems. Backtracking algorithms become inefficient when a bad partial solution is constructed, since an exhaustive search is required for revising the bad decision. On the other hand, iterative improvement algorithms do not construct a consistent partial solution and can revise a bad decision without exhaustive search. However, most of the powerful heuristics obtained through the long history of constraint satisfaction studies (e.g., forward checking (Haralick & Elliot 1980)) presuppose the existence of a consistent partial solution. Therefore, these heuristics can not be applied to iterative improvement algorithms. Furthermore, these algorithms are not theoretically complete. In this paper, a new algorithm called weak-commitment search which utilizes the min-conflict heuristic is developed. This algorithm removes the drawbacks of backtracking algorithms and iterative improvement algorithms, i.e., the algorithm can revise bad decisions without exhaustive search, the completeness of the algorithm is guaranteed, and various heuristics can be introduced since a consistent partial solution is constructed. The experimental results on various example problems show that this algorithm is 3 to 10 times more efficient than other algorithms.

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

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

M3 - Paper

AN - SCOPUS:0028588435

SP - 313

EP - 318

ER -