1 /*
2 * SAT4J: a SATisfiability library for Java Copyright (C) 2004-2006 Daniel Le Berre
3 *
4 * Based on the original minisat specification from:
5 *
6 * An extensible SAT solver. Niklas E?n and Niklas S?rensson. Proceedings of the
7 * Sixth International Conference on Theory and Applications of Satisfiability
8 * Testing, LNCS 2919, pp 502-518, 2003.
9 *
10 * This library is free software; you can redistribute it and/or modify it under
11 * the terms of the GNU Lesser General Public License as published by the Free
12 * Software Foundation; either version 2.1 of the License, or (at your option)
13 * any later version.
14 *
15 * This library is distributed in the hope that it will be useful, but WITHOUT
16 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
17 * FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more
18 * details.
19 *
20 * You should have received a copy of the GNU Lesser General Public License
21 * along with this library; if not, write to the Free Software Foundation, Inc.,
22 * 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
23 *
24 */
25
26 package org.sat4j.reader.csp;
27
28 import org.sat4j.core.VecInt;
29 import org.sat4j.specs.ContradictionException;
30 import org.sat4j.specs.ISolver;
31 import org.sat4j.specs.IVec;
32 import org.sat4j.specs.IVecInt;
33
34 public class AllDiff implements Clausifiable {
35
36 public void toClause(ISolver solver, IVec<Var> scope, IVec<Evaluable> vars)
37 throws ContradictionException {
38 int n = scope.size();
39 IVecInt clause = new VecInt();
40 for (int i = 0; i < n; i++) {
41 Var vi = scope.get(i);
42 for (int j = i + 1; j < n; j++) {
43 // make all values differents
44 Var vj = scope.get(j);
45 for (int vali : vi.domain()) {
46 for (int valj : vj.domain()) {
47 // the two variables share a common value
48 if (vali == valj) {
49 clause.push(-vi.translate(vali));
50 clause.push(-vj.translate(valj));
51 solver.addClause(clause);
52 clause.clear();
53 }
54 }
55 }
56 }
57 }
58 }
59
60 }