View Javadoc

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