View Javadoc

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