Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition

259Citations
Citations of this article
56Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Researchers in the areas of constraint satisfaction problems, logic programming, and truth maintenance systems have suggested various schemes for enhancing the performance of the backtracking algorithm. This paper defines and compares the performance of three such schemes: "backjumping," "learning," and "cycle-cutset." The backjumping and the cycle-cutset methods work best when the constraint graph is sparse, while the learning scheme mostly benefits problem instances with dense constraint graphs. An integrated strategy is described which utilizes the distinct advantages of each scheme. Experiments show that, in hard problems, the average improvement realized by the integrated scheme is 20-25% higher than any of the individual schemes. © 1990.

Cite

CITATION STYLE

APA

Dechter, R. (1990). Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition. Artificial Intelligence, 41(3), 273–312. https://doi.org/10.1016/0004-3702(90)90046-3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free