|
1 |
| package org.sat4j.minisat.constraints.pb; |
|
2 |
| |
|
3 |
| import java.math.BigInteger; |
|
4 |
| |
|
5 |
| import org.sat4j.minisat.core.ILits; |
|
6 |
| |
|
7 |
| public class ConflictArrayClause extends ConflictArray { |
|
8 |
| |
|
9 |
0
| public ConflictArrayClause(int[] lits, BigInteger[] coefs, BigInteger d,
|
|
10 |
| ILits voc, int level) { |
|
11 |
0
| super(lits, coefs, d, voc, level);
|
|
12 |
| } |
|
13 |
| |
|
14 |
0
| public static IConflict createConflict(PBConstr cpb, int level) {
|
|
15 |
0
| return new ConflictArrayClause(cpb.getLits(), cpb.getCoefs(), cpb
|
|
16 |
| .getDegree(), cpb.getVocabulary(), level); |
|
17 |
| } |
|
18 |
| |
|
19 |
| |
|
20 |
| |
|
21 |
| |
|
22 |
| |
|
23 |
| |
|
24 |
| |
|
25 |
| |
|
26 |
| |
|
27 |
| |
|
28 |
| |
|
29 |
0
| @Override
|
|
30 |
| protected BigInteger reduceUntilConflict(int litImplied, int ind, |
|
31 |
| BigInteger[] reducedCoefs, WatchPb wpb) { |
|
32 |
0
| for (int i = 0; i < reducedCoefs.length; i++)
|
|
33 |
0
| if (i == ind || wpb.getVocabulary().isFalsified(wpb.get(i)))
|
|
34 |
0
| reducedCoefs[i] = BigInteger.ONE;
|
|
35 |
| else |
|
36 |
0
| reducedCoefs[i] = BigInteger.ZERO;
|
|
37 |
0
| coefMultCons = coefs[litImplied ^ 1];
|
|
38 |
0
| coefMult = BigInteger.ONE;
|
|
39 |
0
| return BigInteger.ONE;
|
|
40 |
| } |
|
41 |
| } |
