IDC.h

// IDC.h -- The IDC[[-MC]-PDS] decomposition algorithms interface.

/*
 * Copyright (C) 1997, 1998 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: IDC_8h-source.html,v 1.1 2005/05/25 12:37:18 tudor Exp $

#ifndef _CSP_DECOMPOSITIONS_IDC_H
#define _CSP_DECOMPOSITIONS_IDC_H


CSP_NAMESPACE_BEGIN(csp);
CSP_NAMESPACE_BEGIN(decompositions);


#define IDC_DEFAULT_CHOICE_FACTOR 1.08


class CSP_API IDC :
    public Decomposition
{
  public:
    IDC(Problem& problem,
        Filter& filter,
        Retraction& retraction,
        Randomizer& randomizer,
        double choiceFactor = IDC_DEFAULT_CHOICE_FACTOR) :
        Decomposition(
            L"Inferred Disjunctive Constraints",
            L"IDC",
            problem,
            filter,
            retraction,
            randomizer),
        m_mcExtension(false),
        m_choiceFactor(choiceFactor) {}

  protected:
    IDC(const wstring& fullName,
        const wstring& shortName,
        Problem& problem,
        Filter& filter,
        Retraction& retraction,
        Randomizer& randomizer,
        double choiceFactor = IDC_DEFAULT_CHOICE_FACTOR) :
        Decomposition(
            fullName,
            shortName,
            problem,
            filter,
            retraction,
            randomizer),
        m_mcExtension(false),
        m_choiceFactor(choiceFactor) {}

    bool m_mcExtension;

    double m_choiceFactor;

  private:
    IDC(const IDC&);

    IDC& operator=(const IDC&);

    /*
     * Given a subproblem, we need to  compute its `size', defined as the
     * product of the size of the domain of each of its variables.  It is
     * assumed that no variable has an empty domain.
     */
    long double subproblemSize(const vlist_type& vlist);

    /*
     * Compute the size of the consistent subproblem, i.e.  the one
     * that has the selected value removed from `variable' and all the
     * values inconsistent with it removed from the domains of the
     * other variables.  `variable' is supposed to be instantiated to
     * the value with which its neighbors are supposed to be
     * consistent with, while `remainderSize' contains the size of the
     * problem without those values removed.
     */
    long double diffSize(Variable& variable, long double remainderSize);

    virtual void decompose();
};


CSP_NAMESPACE_END(decompositions);
CSP_NAMESPACE_END(csp);


#endif // _CSP_DECOMPOSITIONS_IDC_H

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

---