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.learning;
27
28 import org.sat4j.minisat.core.Constr;
29 import org.sat4j.minisat.core.ILits;
30
31 /**
32 * Allows MiniSAT to do backjumping without learning. The literals appearing in
33 * the reason do not see their activity increased. That solution looks the best
34 * for VLIW-SAT-1.0 benchmarks (1346s vs 1785s).
35 *
36 * @author leberre
37 */
38 public class NoLearningNoHeuristics<L extends ILits> extends AbstractLearning<L> {
39
40 private static final long serialVersionUID = 1L;
41
42 public void learns(Constr reason) {
43 }
44
45 }