include/dlvhex2/FLPModelGeneratorBase.h

Go to the documentation of this file.

/* dlvhex -- Answer-Set Programming with external interfaces.
 * Copyright (C) 2005-2007 Roman Schindlauer
 * Copyright (C) 2006-2015 Thomas Krennwallner
 * Copyright (C) 2009-2016 Peter Schüller
 * Copyright (C) 2011-2016 Christoph Redl
 * Copyright (C) 2015-2016 Tobias Kaminski
 * Copyright (C) 2015-2016 Antonius Weinzierl
 *
 * This file is part of dlvhex.
 *
 * dlvhex 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.1 of
 * the License, or (at your option) any later version.
 *
 * dlvhex 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 dlvhex; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
 * 02110-1301 USA.
 */

#ifndef FLP_MODEL_GENERATOR_BASE_HPP_INCLUDED__09112010
#define FLP_MODEL_GENERATOR_BASE_HPP_INCLUDED__09112010

#include "dlvhex2/PlatformDefinitions.h"
#include "dlvhex2/fwd.h"
#include "dlvhex2/BaseModelGenerator.h"
#include "dlvhex2/AnnotatedGroundProgram.h"

#include <boost/unordered_map.hpp>

DLVHEX_NAMESPACE_BEGIN

class DLVHEX_EXPORT FLPModelGeneratorFactoryBase:
public BaseModelGeneratorFactory
{
    public:
        FLPModelGeneratorFactoryBase(ProgramCtx& ctx);
        virtual ~FLPModelGeneratorFactoryBase() {}

    protected:
        // data
        ProgramCtx& ctx;

        // for getting auxiliaries and registering FLP replacements
        RegistryPtr reg;

        std::vector<ID> idb;

        std::vector<ID> innerEatoms;

        std::vector<ID> gidb;

        std::vector<ID> xidb;

        std::vector<ID> deidb;
        std::vector<ID> deidbInnerEatoms;

        // xidb rewritten for FLP calculation
        std::vector<ID> xidbflphead;
        std::vector<ID> xidbflpbody;

        // incrementally updated bitmask for guessed eatom replacement predicates
        // (positive and negative, respectively)
        PredicateMask gpMask;
        PredicateMask gnMask;

        PredicateMask fMask;

    protected:
        void createEatomGuessingRules(const ProgramCtx& ctx);
        ID createEatomGuessingRule(const ProgramCtx& ctx, ID ruleID, ID litID);

        void createFLPRules();

        void computeCyclicInputPredicates(
            RegistryPtr reg,
            ProgramCtx& ctx,
            const std::vector<ID>& idb);

        friend class FLPModelGeneratorBase;
};

//
// the flp model generator base class (always refers to a factory which prepares the rewritten rules)
//
class DLVHEX_EXPORT FLPModelGeneratorBase:
public BaseModelGenerator
{
    // members
    public:
        FLPModelGeneratorBase(FLPModelGeneratorFactoryBase& factory, InterpretationConstPtr input);
        virtual ~FLPModelGeneratorBase() {}

    protected:
        // the factory storing our flp rewriting and external atom guessing and shared bitmasks
        FLPModelGeneratorFactoryBase& factory;

        AnnotatedGroundProgram annotatedGroundProgram;
    protected:
        virtual bool isCompatibleSet(
            InterpretationConstPtr candidateCompatibleSet,
            InterpretationConstPtr postprocessedInput,
            ProgramCtx& ctx,
            SimpleNogoodContainerPtr nc);

        template<typename OrdinaryASPSolverT>
            bool isSubsetMinimalFLPModel(
            InterpretationConstPtr compatibleSet,
            InterpretationConstPtr postprocessedInput,
            ProgramCtx& ctx,
            SimpleNogoodContainerPtr ngc = SimpleNogoodContainerPtr()
            );

        Nogood getFLPNogood(
            ProgramCtx& ctx,
            const OrdinaryASPProgram& groundProgram,
            InterpretationConstPtr compatibleSet,
            InterpretationConstPtr projectedCompatibleSet,
            InterpretationConstPtr smallerFLPModel
            );

        void computeShadowAndUnfoundedPredicates(
            RegistryPtr reg,
            InterpretationConstPtr edb,
            const std::vector<ID>& idb,
            std::map<ID, std::pair<int, ID> >& shadowPredicates,
            std::map<ID, std::pair<int, ID> >& unfoundedPredicates,
            std::string& shadowPostfix,
            std::string& unfoundedPostfix
            );

        void addShadowInterpretation(
            RegistryPtr reg,
            std::map<ID, std::pair<int, ID> >& shadowPredicates,
            InterpretationConstPtr input,
            InterpretationPtr output);

        void createMinimalityRules(
            RegistryPtr reg,
            std::map<ID, std::pair<int, ID> >& shadowPredicates,
            std::string& shadowPostfix,
            std::vector<ID>& idb);

        void createFoundingRules(
            RegistryPtr reg,
            std::map<ID, std::pair<int, ID> >& shadowPredicates,
            std::map<ID, std::pair<int, ID> >& unfoundedPredicates,
            std::vector<ID>& idb);
};

DLVHEX_NAMESPACE_END

#include "dlvhex2/FLPModelGeneratorBase.tcc"
#endif                           // FLP_MODEL_GENERATOR_BASE_HPP_INCLUDED__09112010

// vim:expandtab:ts=4:sw=4:
// mode: C++
// End: