naturalnumbermultiplierdemo.java

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

package positronic.satisfiability.demos;

import java.util.List;

import positronic.satisfiability.elements.BooleanLiteral;
import positronic.satisfiability.elements.Conjunction;
import positronic.satisfiability.elements.IProblem;
import positronic.satisfiability.elements.Problem;
import positronic.satisfiability.naturalnumber.INaturalNumber;
import positronic.satisfiability.naturalnumber.NaturalNumber;
import positronic.satisfiability.naturalnumber.NaturalNumberFixer;
import positronic.satisfiability.naturalnumber.NaturalNumberMultiplier;
import positronic.satisfiability.solutions.PartialSolution;

public class NaturalNumberMultiplierDemo
{
  public static void main(String[] args) throws Exception
  {
    INaturalNumber X=new NaturalNumber("X");
    INaturalNumber Y=new NaturalNumber("Y");
    INaturalNumber Z=new NaturalNumber("Z");

    IProblem NaturalNumberMultiplier1 = new NaturalNumberMultiplier(X,Y,Z);
    IProblem nnfx=new NaturalNumberFixer(X,3L);
    IProblem nnfy=new NaturalNumberFixer(Y,13L);
    Problem p=new Conjunction(NaturalNumberMultiplier1,nnfx,nnfy);
    System.out.println(p);
    List s=PartialSolution.solveList(p);
		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.");
  }
}