values/SolutionProbability.h

// SolutionProbability.h -- The `maximum/minimum solution probability'
// value ordering heuristic interface.

/*
 * Copyright (C) 2004 Tudor Hulubei <tudor@hulubei.net>.
 *
 * This library is free software; you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as
 * published by the Free Software Foundation; either version 2, or (at
 * your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA,
 * 02111-1307, USA.
 */

// $Id: values_2SolutionProbability_8h-source.html,v 1.1 2005/05/25 12:37:18 tudor Exp $

#ifndef _CSP_HEURISTICS_VALUE_SolutionProbability_H
#define _CSP_HEURISTICS_VALUE_SolutionProbability_H


#include "../../caches/DomainSizes.h"


//#define SP_VAL_LOOK_AROUND 1


#ifdef SP_VAL_LOOK_AROUND
#include <gmpxx.h>
#endif


CSP_NAMESPACE_BEGIN(csp);
CSP_NAMESPACE_BEGIN(heuristics);
CSP_NAMESPACE_BEGIN(values);


class SolutionProbability;


class SolutionProbabilityLT :
    public StrictWeakValueOrdering
{
  public:
    SolutionProbabilityLT() :
        m_variable(0),
        m_heuristic(0),
        m_avs(0),
        m_acs(0) {}

    bool operator()(const Value* value0, const Value* value1);

    void init(
        Variable& variable,
        SolutionProbability& heuristic,
        const Decomposition::ActiveVariablesSet& avs,
        const Decomposition::ActiveConstraintsSet& acs)
    {
        m_variable = &variable;
        m_heuristic = &heuristic;
        m_avs = &avs;
        m_acs = &acs;
    }

  private:
    Variable* m_variable;
    SolutionProbability* m_heuristic;
    const Decomposition::ActiveVariablesSet* m_avs;
    const Decomposition::ActiveConstraintsSet* m_acs;
};


class SolutionProbabilityGT :
    public StrictWeakValueOrdering
{
  public:
    SolutionProbabilityGT() :
        m_variable(0),
        m_heuristic(0),
        m_avs(0),
        m_acs(0) {}

    bool operator()(const Value* value0, const Value* value1);

    void init(
        Variable& variable,
        SolutionProbability& heuristic,
        const Decomposition::ActiveVariablesSet& avs,
        const Decomposition::ActiveConstraintsSet& acs)
    {
        m_variable = &variable;
        m_heuristic = &heuristic;
        m_avs = &avs;
        m_acs = &acs;
    }

  private:
    Variable* m_variable;
    SolutionProbability* m_heuristic;
    const Decomposition::ActiveVariablesSet* m_avs;
    const Decomposition::ActiveConstraintsSet* m_acs;
};


class SolutionProbabilityEQ :
    public StrictWeakValueOrdering
{
  public:
    SolutionProbabilityEQ() :
        m_variable(0),
        m_heuristic(0),
        m_avs(0),
        m_acs(0),
        m_previousValue0(0),
        m_previousValue1(0),
        m_previousSolutionProbability0(0),
        m_previousSolutionProbability1(0) {}

    bool operator()(const Value* value0, const Value* value1);

    void init(
        Variable& variable,
        SolutionProbability& heuristic,
        const Decomposition::ActiveVariablesSet& avs,
        const Decomposition::ActiveConstraintsSet& acs)
    {
        m_variable = &variable;
        m_heuristic = &heuristic;
        m_avs = &avs;
        m_acs = &acs;
    }

    void reset()
    {
        m_previousValue0 = 0;
        m_previousValue1 = 0;
        m_previousSolutionProbability0 = 0;
        m_previousSolutionProbability1 = 0;
    }

  private:
#ifdef SP_VAL_LOOK_AROUND
    typedef mpf_class Real;
#else
    typedef long double Real;
#endif

    Variable* m_variable;
    SolutionProbability* m_heuristic;
    const Decomposition::ActiveVariablesSet* m_avs;
    const Decomposition::ActiveConstraintsSet* m_acs;

    const Value* m_previousValue0;
    const Value* m_previousValue1;

    Real m_previousSolutionProbability0;
    Real m_previousSolutionProbability1;
};


class CSP_API SolutionProbability :
    public ValueOH
{
  public:
#ifdef SP_VAL_LOOK_AROUND
    typedef mpf_class Real;
#else
    typedef long double Real;
#endif

    enum Preference
    {
        Minimum,

        Maximum
    };

    SolutionProbability(
        Decomposition& decomposition,
        const vector<pair<double, double> >& intervals,
        double quality = 1,
        Preference preference = Maximum,
        bool analysis = false);

    virtual void select(
        Domain& selectable,
        Domain& selected,
        Variable& variable);

    virtual bool better(const Value& value0, const Value& value1);

    virtual bool equal(const Value& value0, const Value& value1);

    virtual void sort(
        Domain& original,
        Domain& sorted,
        Variable& variable);

    virtual long double score(Variable& variable, const Value& value);

  private:
    SolutionProbability(const SolutionProbability&);

    SolutionProbability& operator=(const SolutionProbability&);

    ulonglong maxTuples(const Constraint& constraint) const;

    Real constraintProbability(const Constraint& constraint) const;

    void computeProbabilities(
        const Decomposition::ActiveConstraintsSet& acs,
        const Decomposition::ActiveVariablesSet& avs);

    void computeMaxTuples(
        const Decomposition::ActiveConstraintsSet& acs);

    void computeValueProbabilities(
        const Decomposition::ActiveVariablesSet& avs);

    void clearCaches();

    Real subproblemSolutionProbability(
        const Decomposition::ActiveConstraintsSet& acs) const;

    Real valueSubproblemSolutionProbability(
        Variable& variable,
        Value& value,
        const Decomposition::ActiveVariablesSet& avs,
        const Decomposition::ActiveConstraintsSet& acs);

    typedef hash_map<const Constraint*, Real> cp_type;

    typedef hash_map<const Constraint*, ulonglong> mt_type;

    typedef hash_map<const Value*, Real> vp_type;

    typedef hash_map<const Variable*, vp_type*> vs_type;

    cp_type m_constraintProbabilities;

    mt_type m_maxTuples;

    vs_type m_valueProbabilities;

    mutable caches::DomainSizes m_values;

    Preference m_preference;

    Real m_precision;

    SolutionProbabilityLT m_compareLT;

    SolutionProbabilityGT m_compareGT;

    SolutionProbabilityEQ m_compareEQ;

    friend bool SolutionProbabilityLT::operator()(
        const Value* value0, const Value* value1);
    friend bool SolutionProbabilityGT::operator()(
        const Value* value0, const Value* value1);
    friend bool SolutionProbabilityEQ::operator()(
        const Value* value0, const Value* value1);
};


CSP_NAMESPACE_END(values);
CSP_NAMESPACE_END(heuristics);
CSP_NAMESPACE_END(csp);


#endif // _CSP_HEURISTICS_VALUE_SolutionProbability_H

// Local Variables:
// mode: C++
// End:

---