1 |
| |
2 |
| |
3 |
| |
4 |
| |
5 |
| |
6 |
| |
7 |
| package org.sat4j.tools; |
8 |
| |
9 |
| import java.io.Serializable; |
10 |
| |
11 |
| import org.sat4j.core.VecInt; |
12 |
| import org.sat4j.specs.ContradictionException; |
13 |
| import org.sat4j.specs.ISolver; |
14 |
| import org.sat4j.specs.IVecInt; |
15 |
| import org.sat4j.specs.TimeoutException; |
16 |
| |
17 |
| |
18 |
| |
19 |
| |
20 |
| |
21 |
| |
22 |
| |
23 |
| |
24 |
| |
25 |
| |
26 |
| |
27 |
| public class Minimal4CardinalityModel extends SolverDecorator implements |
28 |
| Serializable { |
29 |
| |
30 |
| private static final long serialVersionUID = 1L; |
31 |
| |
32 |
| |
33 |
| |
34 |
| |
35 |
1
| public Minimal4CardinalityModel(ISolver solver) {
|
36 |
1
| super(solver);
|
37 |
| } |
38 |
| |
39 |
| |
40 |
| |
41 |
| |
42 |
| |
43 |
| |
44 |
10
| @Override
|
45 |
| public int[] model() { |
46 |
10
| int[] prevmodel = null;
|
47 |
10
| IVecInt vec = new VecInt();
|
48 |
| |
49 |
10
| try {
|
50 |
10
| do {
|
51 |
13
| prevmodel = super.model();
|
52 |
13
| vec.clear();
|
53 |
13
| for (int i = 1; i <= nVars(); i++) {
|
54 |
39
| vec.push(-i);
|
55 |
| } |
56 |
13
| int counter = 0;
|
57 |
13
| for (int i = 0; i < prevmodel.length; i++) {
|
58 |
39
| if (prevmodel[i] < 0) {
|
59 |
6
| counter++;
|
60 |
| } |
61 |
| } |
62 |
13
| addAtMost(vec, counter - 1);
|
63 |
3
| System.err.println(counter);
|
64 |
3
| } while (isSatisfiable());
|
65 |
| } catch (TimeoutException e) { |
66 |
0
| System.err.println("Solver timed out");
|
67 |
| } catch (ContradictionException e) { |
68 |
10
| System.err.println("added trivial unsat clauses?" + vec);
|
69 |
| } |
70 |
| |
71 |
10
| return prevmodel;
|
72 |
| } |
73 |
| } |