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; 31 32 import java.util.ArrayList; 33 import java.util.List; 34 35 public class Explanation<C> { 36 private final List<DepdendenyNode<C>> roots; 37 private final List<Conflict<C>> conflicts; 38 39 public Explanation() { 40 this.roots = new ArrayList<DepdendenyNode<C>>(); 41 this.conflicts = new ArrayList<Conflict<C>>(); 42 } 43 44 public DepdendenyNode<C> newFalseRoot(C name) { 45 DepdendenyNode<C> root = newNode(name); 46 this.roots.add(root); 47 return root; 48 } 49 50 public DepdendenyNode<C> newNode(C name) { 51 return new DepdendenyNode<C>(name, this); 52 } 53 54 public List<DepdendenyNode<C>> getRoots() { 55 return this.roots; 56 } 57 58 public Conflict<C> newConflict() { 59 Conflict<C> conflict = new Conflict<C>(this); 60 this.conflicts.add(conflict); 61 return conflict; 62 } 63 64 public List<Conflict<C>> getConflicts() { 65 return this.conflicts; 66 } 67 68 }