bitstringordererdemo.java

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

/*
 * BitStringOrdererDemo.java	1.0 05/05/04
 *
 * Copyright 2005 Positronic Software.
 *
 *
 */

package positronic.satisfiability.demos;

import java.util.ArrayList;
import java.util.List;

import positronic.satisfiability.bitstring.BitString;
import positronic.satisfiability.bitstring.BitStringOrderer;
import positronic.satisfiability.bitstring.IBitString;
import positronic.satisfiability.elements.BitFixer;
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 BitStringOrdererDemo
{
  static int degree=4;
  public static void main(String[] args) throws Exception
  {
    IBitString X=new BitString("X",new IBooleanVariable[degree]);
    ArrayList pfix=new ArrayList();
    for(int i=0;i<X.size();i++)
    {
      boolean value;
      if(Math.random()<.5) value=true;
      else value=false;
      X.setBooleanVariable(i,BooleanVariable.getBooleanVariable(X.getName()+"_"+i));
      pfix.add(new BitFixer(X.getBooleanVariable(i),value));
    }

    IBitString Y=new BitString("Y",new IBooleanVariable[degree]);
    for(int i=0;i<Y.size();i++)
      Y.setBooleanVariable(i,BooleanVariable.getBooleanVariable(Y.getName()+"_"+i));

    IProblem fix=new Conjunction(pfix);
    //System.out.println(fix);

    IProblem bta=new BitStringOrderer(X,Y);
    System.out.println(bta);

    IProblem problem=new Conjunction(fix,bta);
    //System.out.println(problem);
    List s=PartialSolution.solveList(problem);
		if(s!=null && s.size()>0)
    {
      BooleanLiteral.interpret(s);
    	System.out.println("X= "+X);
    	System.out.println("Y= "+Y);
    }
    else
      System.out.println("No solution.");
  }
}