naturalnumberbitmultiplydemo.java

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

package positronic.satisfiability.demos;

import java.util.*;
/**
 * <p>Title: TBS</p>
 * <p>Description: TBS</p>
 * <p>Copyright (c) 2005</p>
 * <p>Company: Positronic Software</p>
 * @author Kerry Michael Soileau
 * @version 1.0
 */
import positronic.satisfiability.elements.*;
import positronic.satisfiability.solutions.*;
import positronic.satisfiability.naturalnumber.*;

public class NaturalNumberBitMultiplyDemo
{
  public static void main(String[] args) throws Exception
  {
    IBooleanVariable b=BooleanVariable.getBooleanVariable("b");
    INaturalNumber X=new NaturalNumber("X");
    INaturalNumber Y=new NaturalNumber("Y");

    IProblem p=new Conjunction(
    		new BitFixer(b,false),
    		new NaturalNumberFixer(X,255L),
    		new NaturalNumberBitMultiply(b,X,Y));
    
    List s=PartialSolution.solveList(p);
		if(s!=null && s.size()>0)
    {
      BooleanLiteral.interpret(s);
      System.out.println("b= "+b.getValue());
    	System.out.println("X= "+X);
    	System.out.println("Y= "+Y);
    }
    else
      System.out.println("No solution.");
  }
}