|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||
LearningStrategy | Line # 36 | 0 | 1 | - |
-1.0
|
||||||||||||||||||||||||||||||||||||||||||||||||||||
No Tests | |||
1 | /* | |
2 | * SAT4J: a SATisfiability library for Java Copyright (C) 2004-2006 Daniel Le Berre | |
3 | * | |
4 | * Based on the original minisat specification from: | |
5 | * | |
6 | * An extensible SAT solver. Niklas E?n and Niklas S?rensson. Proceedings of the | |
7 | * Sixth International Conference on Theory and Applications of Satisfiability | |
8 | * Testing, LNCS 2919, pp 502-518, 2003. | |
9 | * | |
10 | * This library is free software; you can redistribute it and/or modify it under | |
11 | * the terms of the GNU Lesser General Public License as published by the Free | |
12 | * Software Foundation; either version 2.1 of the License, or (at your option) | |
13 | * any later version. | |
14 | * | |
15 | * This library is distributed in the hope that it will be useful, but WITHOUT | |
16 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS | |
17 | * FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more | |
18 | * details. | |
19 | * | |
20 | * You should have received a copy of the GNU Lesser General Public License | |
21 | * along with this library; if not, write to the Free Software Foundation, Inc., | |
22 | * 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA | |
23 | * | |
24 | */ | |
25 | ||
26 | package org.sat4j.minisat.core; | |
27 | ||
28 | import java.io.Serializable; | |
29 | ||
30 | /** | |
31 | * Implementation of the strategy design pattern for allowing various learning | |
32 | * schemes. | |
33 | * | |
34 | * @author leberre | |
35 | */ | |
36 | public interface LearningStrategy<L extends ILits> extends Serializable { | |
37 | ||
38 | /** | |
39 | * hook method called just before the search begins. Useful to compute | |
40 | * metrics/parameters based on the input formula. | |
41 | * | |
42 | */ | |
43 | void init(); | |
44 | ||
45 | void learns(Constr constr); | |
46 | ||
47 | void setVarActivityListener(VarActivityListener s); | |
48 | ||
49 | void setSolver(Solver<L> s); | |
50 | } |
|