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.pb.core;
31  
32  import org.sat4j.minisat.core.IOrder;
33  import org.sat4j.minisat.core.LearningStrategy;
34  import org.sat4j.minisat.core.RestartStrategy;
35  import org.sat4j.minisat.core.SearchParams;
36  
37  public class PBSolverResCP extends PBSolverCP {
38  
39      /**
40  	 * 
41  	 */
42      private static final long serialVersionUID = 1L;
43  
44      public static final long MAXCONFLICTS = 100000L;
45  
46      private long bound;
47  
48      public PBSolverResCP(LearningStrategy<PBDataStructureFactory> learner,
49              PBDataStructureFactory dsf, IOrder order) {
50          this(learner, dsf, order, MAXCONFLICTS);
51      }
52  
53      public PBSolverResCP(LearningStrategy<PBDataStructureFactory> learner,
54              PBDataStructureFactory dsf, IOrder order, long bound) {
55          super(learner, dsf, order);
56          this.bound = bound;
57      }
58  
59      public PBSolverResCP(LearningStrategy<PBDataStructureFactory> learner,
60              PBDataStructureFactory dsf, SearchParams params, IOrder order,
61              RestartStrategy restarter) {
62          super(learner, dsf, params, order, restarter);
63      }
64  
65      public PBSolverResCP(LearningStrategy<PBDataStructureFactory> learner,
66              PBDataStructureFactory dsf, SearchParams params, IOrder order) {
67          super(learner, dsf, params, order);
68          // TODO Auto-generated constructor stub
69      }
70  
71      @Override
72      boolean someCriteria() {
73          if (this.stats.conflicts == this.bound) {
74              this.setSimplifier(NO_SIMPLIFICATION);
75              this.reduceDB();
76              this.stats.numberOfCP++;
77              return true;
78          } else if (this.stats.conflicts > this.bound) {
79              this.stats.numberOfCP++;
80              return true;
81          } else {
82              this.stats.numberOfResolution++;
83              return false;
84          }
85      }
86  
87  }