bitstringordererdemo3.java

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

/*
 * BitStringOrdererDemo3.java	1.0 05/10/25
 *
 * Copyright 2005 Positronic Software.
 *
 *
 */

package positronic.satisfiability.demos;

import java.util.List;

import positronic.satisfiability.bitstring.BitString;
import positronic.satisfiability.bitstring.BitStringFixer;
import positronic.satisfiability.bitstring.BitStringOrderer;
import positronic.satisfiability.bitstring.IBitString;
import positronic.satisfiability.elements.BooleanLiteral;
import positronic.satisfiability.elements.Conjunction;
import positronic.satisfiability.elements.IProblem;
import positronic.satisfiability.solutions.PartialSolution;

public class BitStringOrdererDemo3
{
  
  public static void main(String[] args) throws Exception
  {
  	IBitString X=new BitString("X","101");
  	System.out.println(X);
    IProblem fixX=new BitStringFixer(X);
    System.out.println(fixX);
    
    IBitString Y=new BitString("Y","10110");
    System.out.println(Y);
    IProblem fixY=new BitStringFixer(Y);
    System.out.println(fixY);
    
    IProblem bta=new BitStringOrderer(X,Y);
    System.out.println(bta);

    IProblem problem=new Conjunction(fixX,fixY,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.");
  }
}