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

org.metacsp.multi.symbols.SymbolicVariable Maven / Gradle / Ivy

There is a newer version: 1.3.5
Show newest version
/*******************************************************************************
 * Copyright (c) 2010-2013 Federico Pecora 
 * 
 * Permission is hereby granted, free of charge, to any person obtaining
 * a copy of this software and associated documentation files (the
 * "Software"), to deal in the Software without restriction, including
 * without limitation the rights to use, copy, modify, merge, publish,
 * distribute, sublicense, and/or sell copies of the Software, and to
 * permit persons to whom the Software is furnished to do so, subject to
 * the following conditions:
 * 
 * The above copyright notice and this permission notice shall be
 * included in all copies or substantial portions of the Software.
 * 
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 ******************************************************************************/
package org.metacsp.multi.symbols;

import java.util.Arrays;
import java.util.Vector;

import org.metacsp.booleanSAT.BooleanConstraint;
import org.metacsp.booleanSAT.BooleanDomain;
import org.metacsp.booleanSAT.BooleanVariable;
import org.metacsp.framework.Constraint;
import org.metacsp.framework.ConstraintSolver;
import org.metacsp.framework.Domain;
import org.metacsp.framework.Variable;
import org.metacsp.framework.multi.MultiVariable;

public class SymbolicVariable extends MultiVariable {

	/**
	 * 
	 */
	private static final long serialVersionUID = 2975768214982114482L;
	
	private String[] nonSolverDomain = new String[0];

	public SymbolicVariable(ConstraintSolver cs, int id, ConstraintSolver[] internalSolvers, Variable[] internalVars) {
		super(cs, id, internalSolvers, internalVars);
	}

	@Override
	public int compareTo(Variable arg0) {
		// TODO Auto-generated method stub
		return 0;
	}

	@Override
	protected Constraint[] createInternalConstraints(Variable[] variables) {
		if (variables == null || variables.length == 0) return null;
		if (((SymbolicVariableConstraintSolver)this.solver).getSymbols() == null) return null;
		if (((SymbolicVariableConstraintSolver)this.solver).getSymbols().length == 0) return null;
		
		Vector cons = new Vector();
		
		if (((SymbolicVariableConstraintSolver)this.solver).getSingleValue()) {
			// INSERT CONSTRAINT SAYING THAT VAR MUST HAVE AT EXACTLY ONE SYMBOL!
			for (int i = 0; i < variables.length-1; i++) {
				for (int j = i+1; j < variables.length-1; j++) {
					BooleanConstraint c = new BooleanConstraint(new BooleanVariable[] {(BooleanVariable)variables[i], (BooleanVariable)variables[j]}, new boolean[] {false, false});
					c.setAutoRemovable(true);
					cons.add(c);
				}
			}
		}
		
		// === FROM R296 ===
		String wff = "(";
		for (int i = 0; i < variables.length; i++) {
			if (i != variables.length-1) wff += "w" + (i+1) + " v (";
			else wff += "w" + (i+1);
		}
		for (int i = 0; i < variables.length; i++) wff += ")";
		logger.finest("Generated internal WFF for variable " + this.getID() + ": " + wff);
		BooleanVariable[] bvs = new BooleanVariable[variables.length];
		for (int i = 0; i < bvs.length; i++) bvs[i] = (BooleanVariable)variables[i];
		for (BooleanConstraint c : BooleanConstraint.createBooleanConstraints(bvs, wff)) {
			c.setAutoRemovable(true);
			cons.add(c);
		}
		// ====================
		
		return cons.toArray(new BooleanConstraint[cons.size()]);
	}

	@Override
	public void setDomain(Domain d) {
		// TODO Auto-generated method stub
	}

	public void setDomain(String... symbols) {
		String[] solverSymbols = ((SymbolicVariableConstraintSolver)this.solver).getSymbols();
		
		boolean[] solverSymbolsToMakeTrue = new boolean[solverSymbols.length];
		for (int i = 0; i < solverSymbolsToMakeTrue.length; i++) solverSymbolsToMakeTrue[i] = false;
		Vector nonSolverDomainVec = new Vector();
		boolean usesSolverSymbols = false;
		
		for (String symbol : symbols) {
			boolean found = false;
			for (int i = 0; i < solverSymbols.length; i++) {
				if (solverSymbols[i].equals(symbol)) {
					found = true;
					solverSymbolsToMakeTrue[i] = true;
					usesSolverSymbols = true;
					break;
				}
			}
			if (!found) nonSolverDomainVec.add(symbol);
		}
		
		if (usesSolverSymbols) {
			SymbolicValueConstraint equalsCon = new SymbolicValueConstraint(SymbolicValueConstraint.Type.VALUESUBSET);
			equalsCon.setValue(solverSymbolsToMakeTrue);
			equalsCon.setFrom(this);
			equalsCon.setTo(this);
			equalsCon.setAutoRemovable(true);
			//this.solver.addConstraint(equalsCon);
			this.solver.addConstraintNoPropagation(equalsCon);
		}
		
		nonSolverDomain = nonSolverDomainVec.toArray(new String[nonSolverDomainVec.size()]);
	}

	@Override
	public String toString() { return this.id + ": " + Arrays.toString(this.getSymbols()); }
	
	public String[] getSymbols() {
		Vector ret = new Vector();
		for (int i = 0; i < this.getInternalVariables().length; i++) {
			BooleanVariable bv = (BooleanVariable)this.getInternalVariables()[i];
			BooleanDomain bd = (BooleanDomain)bv.getDomain();
			if (bd.canBeTrue()) {
				ret.add(((SymbolicVariableConstraintSolver)this.solver).getSymbol(i));
			}
		}
		for (int i = 0; i < nonSolverDomain.length; i++) {
			ret.add(nonSolverDomain[i]);
		}
		return ret.toArray(new String[ret.size()]);
	}

}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy