org.sat4j.multicore
Class SolverFactory

java.lang.Object
  extended by org.sat4j.core.ASolverFactory<IPBSolver>
      extended by org.sat4j.multicore.SolverFactory
All Implemented Interfaces:
Serializable

public class SolverFactory
extends ASolverFactory<IPBSolver>

See Also:
Serialized Form

Method Summary
 IPBSolver defaultSolver()
          To obtain the default solver of the library.
static SolverFactory instance()
           
 IPBSolver lightSolver()
          To obtain a solver that is suitable for solving many small instances of SAT problems.
static ISolver newManyCore()
           
static IPBSolver newManyCorePB()
           
 
Methods inherited from class org.sat4j.core.ASolverFactory
createSolverByName, solverNames
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Method Detail

instance

public static SolverFactory instance()

newManyCore

public static ISolver newManyCore()

newManyCorePB

public static IPBSolver newManyCorePB()

defaultSolver

public IPBSolver defaultSolver()
Description copied from class: ASolverFactory
To obtain the default solver of the library. The solver is suitable to solve huge SAT benchmarks. It should reflect state-of-the-art SAT technologies. For solving small/easy SAT benchmarks, use lightSolver() instead.

Specified by:
defaultSolver in class ASolverFactory<IPBSolver>
Returns:
a solver from the factory
See Also:
ASolverFactory.lightSolver()

lightSolver

public IPBSolver lightSolver()
Description copied from class: ASolverFactory
To obtain a solver that is suitable for solving many small instances of SAT problems. The solver is not using sophisticated but costly reasoning and avoids to allocate too much memory. For solving bigger SAT benchmarks, use defaultSolver() instead.

Specified by:
lightSolver in class ASolverFactory<IPBSolver>
Returns:
a solver from the factory
See Also:
ASolverFactory.defaultSolver()


Copyright © 2010 Centre de Recherche en Informatique de Lens (CRIL). All Rights Reserved.