1 /*******************************************************************************
2 * SAT4J: a SATisfiability library for Java Copyright (C) 2004, 2012 Artois University and CNRS
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 * Contributors:
28 * CRIL - initial API and implementation
29 *******************************************************************************/
30 package org.sat4j.pb.constraints.pb;
31
32 import java.math.BigInteger;
33
34 import org.sat4j.minisat.core.VarActivityListener;
35 import org.sat4j.specs.IVec;
36 import org.sat4j.specs.IVecInt;
37
38 public interface IDataStructurePB {
39 BigInteger saturation();
40
41 BigInteger cuttingPlane(PBConstr cpb, BigInteger deg,
42 BigInteger[] reducedCoefs, VarActivityListener val);
43
44 BigInteger cuttingPlane(PBConstr cpb, BigInteger degreeCons,
45 BigInteger[] reducedCoefs, BigInteger coefMult,
46 VarActivityListener val);
47
48 BigInteger cuttingPlane(int[] lits, BigInteger[] reducedCoefs,
49 BigInteger deg);
50
51 BigInteger cuttingPlane(int lits[], BigInteger[] reducedCoefs,
52 BigInteger degreeCons, BigInteger coefMult);
53
54 void buildConstraintFromConflict(IVecInt resLits, IVec<BigInteger> resCoefs);
55
56 void buildConstraintFromMapPb(int[] resLits, BigInteger[] resCoefs);
57
58 BigInteger getDegree();
59
60 int size();
61
62 boolean isCardinality();
63
64 int getAssertiveLiteral();
65
66 boolean isLongSufficient();
67
68 }