twobitadder.java

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

/*
 * TwoBitAdder.java	1.11 04/11/24
 *
 * Copyright 2004-2005 Positronic Software.
 *
 *
 */

package positronic.satisfiability.elements;

/**
 * An extension of the IProblem class which performs an add with carry of two
 * BooleanVariables.
 *
 * To use this class, one passes BooleanVariables x, y, z and c to the
 * constructor. The TwoBitAdder object produced is a IProblem, and one may
 * manipulate it using any of the methods provided by the IProblem class.
 *
 * For example, when the IProblem instance p defined by
 *
 * IProblem p=new TwoBitAdder(x,y,z,c);
 *
 * is satisfied, the following truth equation will be satisfied:
 *
 * z == x + y (without carry)
 * c == (carry bit)
 *
 * @author  Kerry Michael Soileau
 * [e-mail]
 * http://web.wt.net/~ksoileau/index.htm
 * @version 1.11, 04/11/24
 * @see IBooleanVariable
 * @see IClause
 * @see IProblem
 * @see String
 */

public class TwoBitAdder extends Problem implements IProblem
{
	private static final long serialVersionUID = 1L;
	
  public TwoBitAdder(IBooleanVariable x, IBooleanVariable y, IBooleanVariable z, IBooleanVariable c) throws Exception
  {
    this.setClauses(new IClause[]
    {
      Clause.newClause().or(x).or(y).orNot(z).or(c),
      Clause.newClause().or(x).orNot(y).or(z).or(c),
      Clause.newClause().orNot(x).or(y).or(z).or(c),
      Clause.newClause().orNot(x).orNot(y).or(z).or(c),
      Clause.newClause().orNot(x).orNot(y).orNot(z).or(c),
      Clause.newClause().or(x).or(y).or(z).orNot(c),
      Clause.newClause().or(x).or(y).orNot(z).orNot(c),
      Clause.newClause().or(x).orNot(y).or(z).orNot(c),
      Clause.newClause().or(x).orNot(y).orNot(z).orNot(c),
      Clause.newClause().orNot(x).or(y).or(z).orNot(c),
      Clause.newClause().orNot(x).or(y).orNot(z).orNot(c),
      Clause.newClause().orNot(x).orNot(y).orNot(z).orNot(c)
    });
  }
}