Computing, School of
School of Computing: Technical Reports
Accessibility Remediation
If you are unable to use this item in its current form due to accessibility barriers, you may request remediation through our remediation request form.
Date of this Version
2012
Document Type
Article
Citation
Department of Computer Science & Engineering, University of Nebraska-Lincoln, Technical Report, TR-UNL-CSE-2012-0007
Abstract
The minimal constraint network of a constraint satisfaction problem (CSP) is a compiled version of the problem where every tuple in a constraint’s relation appears in at least one solution to the CSP. Recently, Gottlob argued that, when a CSP has this property, a number of NP-hard queries can be answered in polynomial time, but he also showed that deciding whether or not a given network is minimal is NP-complete [Gottlob, 2011]. We propose two search-based algorithms for computing the minimal network of a CSP. We investigate the performance of the two algorithms and propose a classifier to select the appropriate algorithm that minimizes the CPU time, using a number of parameters. Our approach constitutes a significant contribution towards the automation of the selection of the appropriate algorithms for computing the minimal network of a CSP. In most cases that we studied, we achieved classifier accuracy of above 90%, which allowed us realize significant time savings.