Modeling choices in quasigroup completion: SAT vs. CSP

  • Authors:

  • Carlos Ansótegui;Alvaro del Val;Iván Dotú;Cèsar Fernández;Felip Manyà

  • Affiliations:

  • Computer Science Department, Universitat de Lleida, L1eida, Spain;Escuela Politécnica Superior, Universidad Autónoma de Madrid, Madrid, Spain;Escuela Politécnica Superior, Universidad Autónoma de Madrid, Madrid, Spain;Computer Science Department, Universitat de Lleida, Lleida, Spain;Computer Science Department, Universitat de Lleida, Lleida, Spain

  • Venue:
  • AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

We perform a systematic comparison of SAT and CSP models for a challenging combinatorial problem, quasigroup completion (QCP). Our empirical results clearly indicate the superiority of the 3D SAT encoding (Kautz et al. 2001), with various solvers, over other SAT and CSP models. We propose a partial explanation of the observed performance. Analytically, we focus on the relative conciseness of the 3D model and the pruning power of unit propagation. Empirically, the focus is on the role of the unit-propagation heuristic of the best performing solver, Satz (Li & Anbulagan 1997), which proves crucial to its success, and results in a significant improvement in scalability when imported into the CSP solvers. Our results strongly suggest that SAT encodings of permutation problems (Hnich, Smith, & Walsh 2004) may well prove quite competitive in other domains, in particular when compared with the currently preferred channeling CSP models.