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.pb.constraints.pb;
31  
32  import java.math.BigInteger;
33  
34  import org.sat4j.minisat.core.VarActivityListener;
35  
36  public interface IConflict extends IDataStructurePB {
37  
38      /**
39       * Effectue une resolution avec une contrainte PB. Met a jour le Conflict.
40       * 
41       * @param cpb
42       *            contrainte avec laquelle on va faire la resolution
43       * @param litImplied
44       *            litteral devant etre resolu
45       * @param val
46       *            TODO
47       * @return la mise a jour du degre
48       */
49      BigInteger resolve(PBConstr cpb, int litImplied, VarActivityListener val);
50  
51      BigInteger slackConflict();
52  
53      boolean isAssertive(int dl);
54  
55      /**
56       * Reduction d'une contrainte On supprime un litteral non assigne
57       * prioritairement, vrai sinon. En aucun cas on ne supprime litImplied.
58       * 
59       * @return mise a jour du degre
60       */
61      public BigInteger reduceInConstraint(IWatchPb wpb,
62              final BigInteger[] coefsBis, final int indLitImplied,
63              final BigInteger degreeBis);
64  
65      /**
66       * retourne le niveau de backtrack : c'est-?-dire le niveau le plus haut
67       * pour lequel la contrainte est assertive
68       * 
69       * @param maxLevel
70       *            le plus bas niveau pour lequel la contrainte est assertive
71       * @return the highest level (smaller int) for which the constraint is
72       *         assertive.
73       */
74      public int getBacktrackLevel(int maxLevel);
75  
76      public void updateSlack(int level);
77  
78      public boolean slackIsCorrect(int decisionLevel);
79  
80  }