Examples of org.sat4j.minisat.constraints.MixedDataStructureDaniel

org.sat4j.minisat.constraints.MixedDataStructureDaniel
Uses specific data strcuture for cardinality constraints. @author leberre

     * @return a "default" "minilearning" solver learning clauses of size
     *         smaller than 10 % of the total number of variables with a heap
     *         based var order.
     */
    public static Solver<ILits,DataStructureFactory<ILits>> newMiniLearningHeap() {
        return newMiniLearningHeap(new MixedDataStructureDaniel());
    }

View Full Code Here

     *                of the initial number of variables
     * @return a "minilearning" solver learning clauses of size smaller than n
     *         of the total number of variables
     */
    public static Solver<ILits,DataStructureFactory<ILits>> newMiniLearning(int n) {
        return newMiniLearning(new MixedDataStructureDaniel(), n);
    }

View Full Code Here

     *         literal that is watched on at least one clause such that its
     *         negation is not watched at all. It is not necessarily a watched
     *         literal.)
     */
    public static Solver<ILits,DataStructureFactory<ILits>> newMiniLearningPure() {
        return newMiniLearning(new MixedDataStructureDaniel(), new PureOrder());
    }

View Full Code Here

        learning.setSolver(solver);
        return solver;
    }


    public static Solver<ILits,DataStructureFactory<ILits>> newMiniLearningEZSimp() {
        return newMiniLearningEZSimp(new MixedDataStructureDaniel());
    }

View Full Code Here

     * @return a default MiniLearning without restarts.
     */
    public static Solver<ILits,DataStructureFactory<ILits>> newMiniLearningHeapEZSimpNoRestarts() {
        LimitedLearning<ILits,DataStructureFactory<ILits>> learning = new PercentLengthLearning<ILits,DataStructureFactory<ILits>>(10);
        Solver<ILits,DataStructureFactory<ILits>> solver = new Solver<ILits,DataStructureFactory<ILits>>(new FirstUIP(), learning,
                new MixedDataStructureDaniel(), new SearchParams(
                        Integer.MAX_VALUE), new VarOrderHeap<ILits>(),
                new MiniSATRestarts());
        learning.setSolver(solver);
        solver.setSimplifier(solver.SIMPLE_SIMPLIFICATION);
        return solver;

View Full Code Here

     * @return a default MiniLearning with restarts beginning at 1000 conflicts.
     */
    public static Solver<ILits,DataStructureFactory<ILits>> newMiniLearningHeapEZSimpLongRestarts() {
        LimitedLearning<ILits,DataStructureFactory<ILits>> learning = new PercentLengthLearning<ILits,DataStructureFactory<ILits>>(10);
        Solver<ILits,DataStructureFactory<ILits>> solver = new Solver<ILits,DataStructureFactory<ILits>>(new FirstUIP(), learning,
                new MixedDataStructureDaniel(), new SearchParams(1000),
                new VarOrderHeap<ILits>(), new MiniSATRestarts());
        learning.setSolver(solver);
        solver.setSimplifier(solver.SIMPLE_SIMPLIFICATION);
        return solver;
    }

View Full Code Here

     *         greater than one.
     */
    public static Solver<ILits,DataStructureFactory<ILits>> newActiveLearning() {
        ActiveLearning<ILits,DataStructureFactory<ILits>> learning = new ActiveLearning<ILits,DataStructureFactory<ILits>>();
        Solver<ILits,DataStructureFactory<ILits>> s = new Solver<ILits,DataStructureFactory<ILits>>(new FirstUIP(), learning,
                new MixedDataStructureDaniel(), new VarOrder<ILits>(),
                new MiniSATRestarts());
        learning.setOrder(s.getOrder());
        learning.setSolver(s);
        return s;
    }

View Full Code Here


    /**
     * @return a SAT solver very close to the original MiniSAT sat solver.
     */
    public static Solver<ILits,DataStructureFactory<ILits>> newMiniSAT() {
        return newMiniSAT(new MixedDataStructureDaniel());
    }

View Full Code Here

     * @return MiniSAT without restarts.
     */
    public static Solver<ILits,DataStructureFactory<ILits>> newMiniSATNoRestarts() {
        MiniSATLearning<ILits,DataStructureFactory<ILits>> learning = new MiniSATLearning<ILits,DataStructureFactory<ILits>>();
        Solver<ILits,DataStructureFactory<ILits>> solver = new Solver<ILits,DataStructureFactory<ILits>>(new FirstUIP(), learning,
                new MixedDataStructureDaniel(), new SearchParams(
                        Integer.MAX_VALUE), new VarOrder<ILits>(),
                new MiniSATRestarts());
        learning.setDataStructureFactory(solver.getDSFactory());
        learning.setVarActivityListener(solver);
        return solver;

View Full Code Here


    /**
     * @return a SAT solver very close to the original MiniSAT sat solver.
     */
    public static Solver<ILits,DataStructureFactory<ILits>> newMiniSATHeap() {
        return newMiniSATHeap(new MixedDataStructureDaniel());
    }

View Full Code Here

0 1

TOP

Related Classes of org.sat4j.minisat.constraints.MixedDataStructureDaniel

org.sat4j.minisat.constraints.cnf.LearntBinaryClause

org.sat4j.minisat.constraints.cnf.LearntHTClause

org.sat4j.minisat.constraints.cnf.Lits

org.sat4j.minisat.constraints.cnf.UnitClause

org.sat4j.minisat.SolverFactory

org.sat4j.specs.IVecInt

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.