All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.chocosolver.solver.constraints.reification.PropReif Maven / Gradle / Ivy

There is a newer version: 4.10.17
Show newest version
/*
 * This file is part of choco-solver, http://choco-solver.org/
 *
 * Copyright (c) 2019, IMT Atlantique. All rights reserved.
 *
 * Licensed under the BSD 4-clause license.
 *
 * See LICENSE file in the project root for full license information.
 */
package org.chocosolver.solver.constraints.reification;

import org.chocosolver.solver.constraints.Constraint;
import org.chocosolver.solver.constraints.Propagator;
import org.chocosolver.solver.constraints.PropagatorPriority;
import org.chocosolver.solver.constraints.ReificationConstraint;
import org.chocosolver.solver.exception.ContradictionException;
import org.chocosolver.solver.variables.BoolVar;
import org.chocosolver.solver.variables.Variable;
import org.chocosolver.util.ESat;

/**
 * Implication propagator
 * 

*
* * @author Jean-Guillaume Fages * @since 02/2013 */ public class PropReif extends Propagator { //*********************************************************************************** // VARIABLES //*********************************************************************************** // boolean variable of the reification private final BoolVar bVar; // constraint to apply if bVar = true private final Constraint trueCons; // constraint to apply if bVar = false private final Constraint falseCons; // constraint in charge of the reification process (constraint of this propagator) private ReificationConstraint reifCons; //*********************************************************************************** // CONSTRUCTION //*********************************************************************************** public PropReif(Variable[] allVars, Constraint consIfBoolTrue, Constraint consIfBoolFalse) { super(allVars, computePrority(consIfBoolTrue, consIfBoolFalse), false); this.bVar = (BoolVar) vars[0]; this.trueCons = consIfBoolTrue; this.falseCons = consIfBoolFalse; } public void setReifCons(ReificationConstraint reifCons) { assert this.reifCons == null : "cannot change the ReificationConstraint of a PropReif"; this.reifCons = reifCons; } private static PropagatorPriority computePrority(Constraint consIfBoolTrue, Constraint consIfBoolFalse) { int p = Math.min(consIfBoolTrue.computeMaxPriority().priority, consIfBoolFalse.computeMaxPriority().priority); return PropagatorPriority.get(Math.min(p, PropagatorPriority.TERNARY.priority)); } //*********************************************************************************** // METHODS //*********************************************************************************** @Override public void propagate(int evtmask) throws ContradictionException { if (bVar.isInstantiated()) { setPassive(); if (bVar.getBooleanValue() == ESat.TRUE) { reifCons.activate(0); } else { reifCons.activate(1); } } else { ESat sat = trueCons.isSatisfied(); if (sat == ESat.TRUE) { bVar.setToTrue(this); setPassive(); reifCons.activate(0); } else if (sat == ESat.FALSE) { bVar.setToFalse(this); setPassive(); reifCons.activate(1); } // else {// in case the entailment has not the same implementation // sat = falseCons.isSatisfied(); // if (sat == ESat.FALSE) { // bVar.setToTrue(this); // reifCons.activate(0); // setPassive(); // }else if(sat == ESat.TRUE){ // bVar.setToFalse(this); // reifCons.activate(1); // setPassive(); // } // } } } @Override public ESat isEntailed() { if (bVar.isInstantiated()) { if (bVar.getValue() == 1) { return trueCons.isSatisfied(); } else { return falseCons.isSatisfied(); } } else { // a constraint an its opposite can neither be both true nor both false ESat tie = trueCons.isSatisfied(); if (tie != ESat.UNDEFINED) { ESat fie = falseCons.isSatisfied(); if (tie == fie) { return ESat.FALSE; } } } return ESat.UNDEFINED; } @Override public String toString() { return bVar.toString() + "=>" + trueCons.toString() + ", !" + bVar.toString() + "=>" + falseCons.toString(); } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy