bitinequalityindicator.java

来自「Java版的SAT求解器」· Java 代码 · 共 46 行

/*
 * BitInequalityIndicator.java	1.1 04/10/05
 *
 * Copyright 2004-2005 Positronic Software.
 *
 *
 */

package positronic.satisfiability.elements;

 /**
 * An extension of the Problem class which imposes a Boolean relation on three
 * IBooleanVariables. For example, the Problem instance p defined by
 *
 * <p><tt>Problem p=new BitInequalityIndicator(x,y,z);</tt></p>
 *
 * is satisfied if and only if the following Boolean relation is satisfied:
 *
 * <p><tt>z == (x!=y)</tt></p>
 *
 * @author  Kerry Michael Soileau
 * [e-mail]
 * http://web.wt.net/~ksoileau/index.htm
 * @version 1.1, 04/10/05
 * @see IBooleanVariable
 * @see IClause
 * @see Problem
 */
public class BitInequalityIndicator extends Problem implements IProblem
{
  private static final long serialVersionUID = 1L;

  public BitInequalityIndicator(IBooleanVariable x, IBooleanVariable y, IBooleanVariable z)
    throws Exception
  {
    this.setClauses(new IClause[]
    {
    		Clause.newClause().or(x).or(y).orNot(z),
    		Clause.newClause().or(x).orNot(y).or(z),
    		Clause.newClause().orNot(x).or(y).or(z),
    		Clause.newClause().orNot(x).orNot(y).orNot(z)
    });
  }
}