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.tools;
31
32 import org.sat4j.specs.ISolverService;
33 import org.sat4j.specs.RandomAccessModel;
34 import org.sat4j.specs.Lbool;
35
36 /**
37 * That class allows to iterate over the models from the inside: conflicts are
38 * created to ask the solver to backtrack.
39 *
40 * @author leberre
41 *
42 */
43 public class SearchEnumeratorListener extends
44 SearchListenerAdapter<ISolverService> {
45
46 /**
47 *
48 */
49 private static final long serialVersionUID = 1L;
50
51 private ISolverService solverService;
52
53 private int nbsolutions = 0;
54
55 private final SolutionFoundListener sfl;
56
57 public SearchEnumeratorListener(SolutionFoundListener sfl) {
58 this.sfl = sfl;
59 }
60
61 @Override
62 public void init(ISolverService solverService) {
63 this.solverService = solverService;
64 }
65
66 @Override
67 public void solutionFound(int[] model, RandomAccessModel lazyModel) {
68 int[] clause = new int[model.length];
69 for (int i = 0; i < model.length; i++) {
70 clause[i] = -model[i];
71 }
72 this.solverService.addClauseOnTheFly(clause);
73 this.nbsolutions++;
74 sfl.onSolutionFound(model);
75 }
76
77 @Override
78 public void end(Lbool result) {
79 assert result != Lbool.TRUE;
80 }
81
82 public int getNumberOfSolutionFound() {
83 return this.nbsolutions;
84 }
85 }