MaxWalkSATRoom.java

Go to the documentation of this file.

package edu.tum.cs.logic.sat.weighted;

import java.util.Vector;

import edu.tum.cs.logic.Formula;
import edu.tum.cs.logic.GroundAtom;
import edu.tum.cs.logic.PossibleWorld;
import edu.tum.cs.logic.WorldVariables;
import edu.tum.cs.srl.Database;

public class MaxWalkSATRoom extends MaxWalkSAT {
        
        public boolean alternativeMethod = true;

    public MaxWalkSATRoom(WeightedClausalKB kb, PossibleWorld state, WorldVariables vars, Database evidence) throws Exception {
        super(kb, state, vars, evidence);
    }

    @Override
    public void setState() {
        // set state randomly
        super.setState();
        // now reset the workplace after relocation to the same as before
        int count = 0;
        for(int i = 0; i < vars.size(); i++) {
            if(this.evidence.containsKey(i)) 
                continue;
            GroundAtom ga = vars.get(i);
            String gaName = ga.toString();
            GroundAtom vorher;
            if(gaName.startsWith("workplaceAfter"))
                vorher = vars.get(gaName.replace("After", "Before"));
                else if(gaName.startsWith("employeeIn")) 
                vorher = vars.get(gaName.replace("employeeIn", "roomBefore"));
            else
                continue;
            state.set(i, vorher.isTrue(state));
            count++;
        }
        System.out.printf("reinitialized %d ground atoms according to room planning heuristic.\n", count);
    }

    public void printBestState() {
        System.out.println("Methode: " + deltaCostCalcMethod);
        System.out.println("Steps: " + this.maxSteps);
        System.out.println("*********** Best State after " + lastMinStep + " Steps *************");
        boolean[] s = bestState.getState();
        for (int c = 0; c < s.length; c++) {
            String temp = "";
            if (!s[c]) {
                temp = "!";
            }
            System.out.println(temp += vars.get(c).toString());
            System.out.println(vars.get(c).toString() + " - > " + s[c]);
        }
        System.out.println("Unsatisfied Sum: " + minSum);
        //fr.close();
    }
    
    protected void SAMove() {
        if(alternativeMethod)
                walkSATMove();
        else
                super.SAMove();
    }
    
    @Override
    protected void walkSATMove() {
        if(!alternativeMethod) {
                super.walkSATMove();
                return;
        }
        boolean found;
        double formulaDelta = 0;
        // a random value in size of list of unsatisfied constraints (= random position)
        int x = rand.nextInt(unsatisfiedConstraints.size());
        Formula parent;

        do {
            // if the end of the list is reached execute a SAMove
            if (x == unsatisfiedConstraints.size()) {
                SAMoves++;
                super.SAMove();
                return;
            } else {
                // else search for an unsatisfied constraint to be satisfied
                Vector<Object> bestGAinFormula = new Vector<Object>();
                formulaDelta = 0;
                // Get the according formula of the determined constraint
                parent = cl2Formula.get(unsatisfiedConstraints.get(x));
                do {
                    x++;
                    // for each in the formula containing weighted clause get the candidates and value of the effects on the possible world
                    for (WeightedClause con : formula2clauses.get(parent)) {
                        if (unsatisfiedConstraints.contains(con)) {
                            bestGAinFormula.addAll(con.greedySatisfy());
                        }
                    }
                    // add all effects (values)
                    for (Object o : bestGAinFormula) {
                        if (o instanceof Double) {
                            formulaDelta += ((Double) o).doubleValue();
                        }
                    }
                    // if the satisfaction of the formula enhances the actual state the flip groundatoms
                    if (formulaDelta < 0) {
                        for (Object o : bestGAinFormula) {
                            if (o instanceof GroundAtom) {
                                flipGndAtom((GroundAtom) o);
                            }
                        }
                        found = true;
                        greedyMoves++;
                        break;
                    } else {
                        // else do nothing and determine next constraint
                        found = false;
                        break;
                    }

                } while (!parent.isTrue(state));
            }
        } while (!found);
    }

}

---

srldb
Author(s): Dominik Jain, Stefan Waldherr, Moritz Tenorth
autogenerated on Fri Jan 11 09:58:29 2013