On generators of random quasigroup problems

Authors:
Roman Barták
Affiliations:
Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic
Venue:
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
Year:
2005

Citing 7
Cited 0

A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
An Open-Ended Finite Domain Constraint Solver

PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Generating Satisfiable Problem Instances

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Random Constraint Satisfaction: Theory Meets Practice

CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Limited assignments: a new cutoff strategy for incomplete depth-first search

Proceedings of the 2005 ACM symposium on Applied computing
Channeling constraints and value ordering in the quasigroup completion problem

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Problem structure in the presence of perturbations

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Problems that can be sampled randomly are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representatives of structured random problems that are closer to real-life problems and hence more suitable for benchmarking. In this paper, we describe in detail generators for Quasigroup Completion Problem (QCP) and Quasigroups with Holes (QWH). In particular, we study an improvement of the generator for QCP that produces a larger number of satisfiable problems by using propagation through the all-different constraint. We also re-formulate the algorithm for generating QWH that is much faster than the original generator. Finally, we provide an experimental comparison of all presented generators.