1 /*******************************************************************************
2 * SAT4J: a SATisfiability library for Java Copyright (C) 2004-2008 Daniel Le Berre
3 *
4 * All rights reserved. This program and the accompanying materials
5 * are made available under the terms of the Eclipse Public License v1.0
6 * which accompanies this distribution, and is available at
7 * http://www.eclipse.org/legal/epl-v10.html
8 *
9 * Alternatively, the contents of this file may be used under the terms of
10 * either the GNU Lesser General Public License Version 2.1 or later (the
11 * "LGPL"), in which case the provisions of the LGPL are applicable instead
12 * of those above. If you wish to allow use of your version of this file only
13 * under the terms of the LGPL, and not to allow others to use your version of
14 * this file under the terms of the EPL, indicate your decision by deleting
15 * the provisions above and replace them with the notice and other provisions
16 * required by the LGPL. If you do not delete the provisions above, a recipient
17 * may use your version of this file under the terms of the EPL or the LGPL.
18 *
19 * Based on the original MiniSat specification from:
20 *
21 * An extensible SAT solver. Niklas Een and Niklas Sorensson. Proceedings of the
22 * Sixth International Conference on Theory and Applications of Satisfiability
23 * Testing, LNCS 2919, pp 502-518, 2003.
24 *
25 * See www.minisat.se for the original solver in C++.
26 *
27 *******************************************************************************/
28 package org.sat4j.minisat.constraints.card;
29
30 import org.sat4j.minisat.core.ILits;
31 import org.sat4j.minisat.core.UnitPropagationListener;
32 import org.sat4j.specs.ContradictionException;
33 import org.sat4j.specs.IVecInt;
34
35 public abstract class Cards {
36
37 public static int niceParameters(UnitPropagationListener s, ILits voc,
38 IVecInt ps, int deg) throws ContradictionException {
39
40 if (ps.size() < deg)
41 throw new ContradictionException();
42 int degree = deg;
43 for (int i = 0; i < ps.size();) {
44 // on verifie si le litteral est affecte
45 if (voc.isUnassigned(ps.get(i))) {
46 // go to next literal
47 i++;
48 } else {
49 // Si le litteral est satisfait,
50 // ?a revient ? baisser le degr?
51 if (voc.isSatisfied(ps.get(i))) {
52 degree--;
53 }
54 // dans tous les cas, s'il est assign?,
55 // on enleve le ieme litteral
56 ps.delete(i);
57 }
58 }
59
60 // on trie le vecteur ps
61 ps.sortUnique();
62 // ?limine les clauses tautologiques
63 // deux litt?raux de signe oppos?s apparaissent dans la m?me
64 // clause
65
66 if (ps.size() == degree) {
67 for (int i = 0; i < ps.size(); i++) {
68 if (!s.enqueue(ps.get(i))) {
69 throw new ContradictionException();
70 }
71 }
72 return 0;
73 }
74
75 if (ps.size() < degree)
76 throw new ContradictionException();
77 return degree;
78
79 }
80
81
82 }