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