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.minisat.constraints;
31
32 import org.sat4j.minisat.constraints.card.AtLeast;
33 import org.sat4j.minisat.constraints.cnf.Clauses;
34 import org.sat4j.minisat.constraints.cnf.LearntBinaryClause;
35 import org.sat4j.minisat.constraints.cnf.LearntWLClause;
36 import org.sat4j.minisat.constraints.cnf.Lits;
37 import org.sat4j.minisat.constraints.cnf.OriginalBinaryClause;
38 import org.sat4j.minisat.constraints.cnf.OriginalWLClause;
39 import org.sat4j.minisat.constraints.cnf.UnitClause;
40 import org.sat4j.minisat.core.Constr;
41 import org.sat4j.minisat.core.ILits;
42 import org.sat4j.specs.ContradictionException;
43 import org.sat4j.specs.IVecInt;
44
45 /**
46 * @author leberre
47 * @since 2.1
48 */
49 public class MixedDataStructureDanielWL extends AbstractDataStructureFactory {
50
51 private static final long serialVersionUID = 1L;
52
53 /*
54 * (non-Javadoc)
55 *
56 * @see
57 * org.sat4j.minisat.DataStructureFactory#createCardinalityConstraint(org
58 * .sat4j.datatype.VecInt, int)
59 */
60 @Override
61 public Constr createCardinalityConstraint(IVecInt literals, int degree)
62 throws ContradictionException {
63 return AtLeast.atLeastNew(this.solver, getVocabulary(), literals,
64 degree);
65 }
66
67 @Override
68 public Constr createUnregisteredCardinalityConstraint(IVecInt literals,
69 int degree) {
70 return new AtLeast(getVocabulary(), literals, degree);
71 }
72
73 /*
74 * (non-Javadoc)
75 *
76 * @see
77 * org.sat4j.minisat.DataStructureFactory#createClause(org.sat4j.datatype
78 * .VecInt)
79 */
80 public Constr createClause(IVecInt literals) throws ContradictionException {
81 IVecInt v = Clauses.sanityCheck(literals, getVocabulary(), this.solver);
82 if (v == null) {
83 // tautological clause
84 return null;
85 }
86 if (v.size() == 1) {
87 return new UnitClause(v.last());
88 }
89 if (v.size() == 2) {
90 return OriginalBinaryClause.brandNewClause(this.solver,
91 getVocabulary(), v);
92 }
93 return OriginalWLClause.brandNewClause(this.solver, getVocabulary(), v);
94 }
95
96 public Constr createUnregisteredClause(IVecInt literals) {
97 if (literals.size() == 1) {
98 return new UnitClause(literals.last());
99 }
100 if (literals.size() == 2) {
101 return new LearntBinaryClause(literals, getVocabulary());
102 }
103 return new LearntWLClause(literals, getVocabulary());
104 }
105
106 @Override
107 protected ILits createLits() {
108 return new Lits();
109 }
110 }