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 pseudo boolean algorithms described in:
20 * A fast pseudo-Boolean constraint solver Chai, D.; Kuehlmann, A.
21 * Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
22 * Volume 24, Issue 3, March 2005 Page(s): 305 - 317
23 *
24 * and
25 * Heidi E. Dixon, 2004. Automating Pseudo-Boolean Inference within a DPLL
26 * Framework. Ph.D. Dissertation, University of Oregon.
27 *******************************************************************************/
28 package org.sat4j.pb.constraints;
29
30 import java.math.BigInteger;
31
32 import org.sat4j.minisat.constraints.cnf.Clauses;
33 import org.sat4j.pb.constraints.pb.BinaryClausePB;
34 import org.sat4j.pb.constraints.pb.HTClausePB;
35 import org.sat4j.pb.constraints.pb.PBConstr;
36 import org.sat4j.pb.constraints.pb.UnitClausePB;
37 import org.sat4j.specs.ContradictionException;
38 import org.sat4j.specs.IVec;
39 import org.sat4j.specs.IVecInt;
40
41 /**
42 * The root of the data structures that manage all the constraints as PBConstr
43 * (that way, cutting planes can be applied).
44 *
45 * @author leberre
46 *
47 */
48 public abstract class AbstractPBDataStructureFactoryPB extends
49 AbstractPBDataStructureFactory {
50
51
52 /**
53 *
54 */
55 private static final long serialVersionUID = 1L;
56
57 @Override
58 public PBConstr createUnregisteredPseudoBooleanConstraint(IVecInt literals,
59 IVec<BigInteger> coefs, BigInteger degree) {
60 return constraintFactory(literals, coefs, degree);
61 }
62
63
64 @Override
65 public PBConstr createClause(IVecInt literals) throws ContradictionException {
66 IVecInt theLits = Clauses.sanityCheck(literals,getVocabulary(), solver);
67 if (theLits==null) {
68 return null;
69 }
70 if (theLits.size()==2) {
71 BinaryClausePB.brandNewClause(solver, getVocabulary(), theLits);
72 }
73 return HTClausePB.brandNewClause(solver, getVocabulary(),theLits);
74 }
75
76 @Override
77 public PBConstr createUnregisteredClause(IVecInt literals) {
78 if (literals.size()==1)
79 return new UnitClausePB(literals.last());
80 if (literals.size()==2)
81 return new BinaryClausePB(literals,getVocabulary());
82 return new HTClausePB(literals,getVocabulary());
83 }
84
85 }