| 
 | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| ILits2 | Line # 33 | 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 | /** | |
| 29 | * Specific vocabulary taking special care of binary clauses. | |
| 30 | * | |
| 31 | * @author leberre | |
| 32 | */ | |
| 33 | public interface ILits2 extends ILits { | |
| 34 | ||
| 35 | /** | |
| 36 | * To know the number of binary clauses in which the literal occurs. Please | |
| 37 | * note that this method should only be used in conjunction with the | |
| 38 | * BinaryClauses data structure. | |
| 39 | * | |
| 40 | * @param p | |
| 41 | * @return the number of binary clauses. | |
| 42 | */ | |
| 43 | int nBinaryClauses(int p); | |
| 44 | ||
| 45 | /** | |
| 46 | * Method to create a binary clause. | |
| 47 | * | |
| 48 | * @param lit1 | |
| 49 | * the first literal of the clause | |
| 50 | * @param lit2 | |
| 51 | * the second literal of the clause | |
| 52 | */ | |
| 53 | void binaryClauses(int lit1, int lit2); | |
| 54 | ||
| 55 | } | |
| 
 | ||||||||||