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.core;
31
32 import org.sat4j.specs.ILogAble;
33 import org.sat4j.specs.ISolver;
34 import org.sat4j.specs.UnitPropagationListener;
35
36 /**
37 * Abstraction for Conflict Driven Clause Learning Solver.
38 *
39 * Allows to easily access the various options available to setup the solver.
40 *
41 * @author daniel
42 *
43 * @param <D>
44 */
45 public interface ICDCL<D extends DataStructureFactory> extends ISolver,
46 UnitPropagationListener, ActivityListener, Learner {
47
48 /**
49 * Change the internal representation of the constraints. Note that the
50 * heuristics must be changed prior to calling that method.
51 *
52 * @param dsf
53 * the internal factory
54 */
55 void setDataStructureFactory(D dsf);
56
57 /**
58 *
59 * @since 2.2
60 * @deprecated renamed into setLearningStrategy()
61 * @see #setLearningStrategy(LearningStrategy)
62 */
63 @Deprecated
64 void setLearner(LearningStrategy<D> learner);
65
66 /**
67 * Allow to change the learning strategy, i.e. to decide which
68 * clauses/constraints should be learned by the solver after conflict
69 * analysis.
70 *
71 * @since 2.3.3
72 */
73 void setLearningStrategy(LearningStrategy<D> strategy);
74
75 void setSearchParams(SearchParams sp);
76
77 SearchParams getSearchParams();
78
79 SolverStats getStats();
80
81 void setRestartStrategy(RestartStrategy restarter);
82
83 RestartStrategy getRestartStrategy();
84
85 /**
86 * Setup the reason simplification strategy. By default, there is no reason
87 * simplification. NOTE THAT REASON SIMPLIFICATION DOES NOT WORK WITH
88 * SPECIFIC DATA STRUCTURE FOR HANDLING BOTH BINARY AND TERNARY CLAUSES.
89 *
90 * @param simp
91 * a simplification type.
92 *
93 */
94 void setSimplifier(SimplificationType simp);
95
96 /**
97 * Setup the reason simplification strategy. By default, there is no reason
98 * simplification. NOTE THAT REASON SIMPLIFICATION IS ONLY ALLOWED FOR WL
99 * CLAUSAL data structures. USING REASON SIMPLIFICATION ON CB CLAUSES,
100 * CARDINALITY CONSTRAINTS OR PB CONSTRAINTS MIGHT RESULT IN INCORRECT
101 * RESULTS.
102 *
103 * @param simp
104 */
105 void setSimplifier(ISimplifier simp);
106
107 ISimplifier getSimplifier();
108
109 /**
110 * @param lcds
111 * @since 2.1
112 */
113 void setLearnedConstraintsDeletionStrategy(
114 LearnedConstraintsDeletionStrategy lcds);
115
116 /**
117 *
118 * @param timer
119 * when to apply constraints cleanup.
120 * @param evaluation
121 * the strategy used to evaluate learned clauses.
122 * @since 2.3.2
123 */
124 void setLearnedConstraintsDeletionStrategy(ConflictTimer timer,
125 LearnedConstraintsEvaluationType evaluation);
126
127 /**
128 *
129 * @param evaluation
130 * the strategy used to evaluate learned clauses.
131 * @since 2.3.2
132 */
133 void setLearnedConstraintsDeletionStrategy(
134 LearnedConstraintsEvaluationType evaluation);
135
136 IOrder getOrder();
137
138 void setOrder(IOrder h);
139
140 void setNeedToReduceDB(boolean needToReduceDB);
141
142 void setLogger(ILogAble out);
143
144 ILogAble getLogger();
145 }