Selecting the Appropriate Consistency Algorithm for CSPs Using Machine Learning Classifiers

Computing the minimal network of a Constraint Satisfaction Problem (CSP) is a useful and difficult task. Two algorithms, PerTuple and AllSol, were proposed to this end. The performances of these algorithms vary with the problem instance. We use Machine Learning techniques to build a classifier that predicts which of the two algorithms is likely to be more effective.

Authors

• Daniel Geschwender
• Shant Karakashian University of Nebraska-Lincoln
• Robert Woodward
• Berthe Choueiry
• Stephen Scott University of Nebraska - Lincoln

Keywords

No keywords are indexed for this paper.