bitxorerdemo.java

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

package positronic.satisfiability.demos;

import java.util.List;

import positronic.satisfiability.elements.BitFixer;
import positronic.satisfiability.elements.BitXorer;
import positronic.satisfiability.elements.BooleanLiteral;
import positronic.satisfiability.elements.BooleanVariable;
import positronic.satisfiability.elements.Conjunction;
import positronic.satisfiability.elements.IBooleanVariable;
import positronic.satisfiability.elements.IProblem;
import positronic.satisfiability.solutions.PartialSolution;

public class BitXorerDemo
{
  public static void main(String[] args) throws Exception
  {
    IBooleanVariable x=BooleanVariable.getBooleanVariable("x");
    IBooleanVariable y=BooleanVariable.getBooleanVariable("y");
    IBooleanVariable z=BooleanVariable.getBooleanVariable("z");
    
    IProblem fixx=new BitFixer(x,false);
    IProblem fixz=new BitFixer(z,true);
    IProblem bitXorer1 = new BitXorer(x,y,z);

    IProblem problem=new Conjunction(fixx,fixz,bitXorer1);
    System.out.println(bitXorer1);
    
    List s=PartialSolution.solveList(problem);
		if(s!=null && s.size()>0)
    {
      BooleanLiteral.interpret(s);
    	System.out.println("x= "+x);
    	System.out.println("y= "+y);
    	System.out.println("z= "+z);
    }
    else
      System.out.println("No solution.");
  }
}