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
4-2002
Document Type
Article
Abstract
The paper describes an implementation of a generator of random instances of non-binary constraint satisfaction problems that meets a given set of specifications. This is a continuation of the work we started in Hui Zou, Amy M. Beckwith, and Berthe Y. Choueiry. A Generator of Random Instances of Binary Finite Constraint Satisfaction Problems with Controllable Levels of Interchangeability. Working note, Department of Computer Science and Engineering, University of Nebraska-Lincoln, 2001. July, 2001.
The program is designed to generate random instances of Constraint Satisfaction Problems (CSPs) that meet a set of specified parameters, such as the number of variables, domain size, constraint density, tightness. At the same time, it can generate any combination of binary, ternary, and/or quaternary constraints specifies as percentage of the total number of constraints in the problem.
Comments
Technical Report CONSYSTLAB-02-02
Constraint Systems Laboratory
Department of Computer Science and Engineering
University of Nebraska-Lincoln