00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013
00014
00015
00016
00017
00018
00019
00020
00021
00022
00023
00024
00025
00026
00027
00028
00029
00030
00031
00032
00033
00034
00035
00036
00037
00038
00039
00040
00041
00042
00043
00044
00045
00046
00047
00048
00049
00050
00051
00052
00053
00054
00055
00056
00057
00058
00059
00060
00061
00062
00063
00064
00065
00066 #ifndef GROUNDPREDICATE_H_JUN_26_2005
00067 #define GROUNDPREDICATE_H_JUN_26_2005
00068
00069 #include <cmath>
00070 #include "domain.h"
00071 #include "predicate.h"
00072 #include "groundclause.h"
00073
00074 class GroundPredicate
00075 {
00076 public:
00077 GroundPredicate(Predicate* const & pred)
00078 : negGndClauses_(new Array<GroundClause*>),
00079 posGndClauses_(new Array<GroundClause*>),
00080 gndClauseSet_(new GroundClauseSet),
00081 truthValue_(false), wtWhenFalse_(0), wtWhenTrue_(0)
00082 {
00083 assert(pred->isGrounded());
00084 int numTerms = pred->getNumTerms();
00085 intArrRep_ = new Array<unsigned int>(numTerms+1);
00086 intArrRep_->growToSize(numTerms+1);
00087 (*intArrRep_)[0] = pred->getId();
00088 assert((*intArrRep_)[0] >= 0);
00089 for (int i = 0; i < numTerms; i++)
00090 {
00091 (*intArrRep_)[i+1] = pred->getTerm(i)->getId();
00092 assert((*intArrRep_)[i+1] >= 0);
00093 }
00094 intArrRep_->compress();
00095 hashCode_ = Hash::hash(*intArrRep_);
00096 }
00097
00098
00099 ~GroundPredicate()
00100 {
00101 if (intArrRep_) delete intArrRep_;
00102 if (gndClauseSet_) delete gndClauseSet_;
00103 delete negGndClauses_;
00104 delete posGndClauses_;
00105 }
00106
00107
00108 void deleteGndClauseSet()
00109 { if (gndClauseSet_) delete gndClauseSet_; gndClauseSet_ = NULL; }
00110
00115 void removeGndClauses()
00116 {
00117 deleteGndClauseSet();
00118 delete negGndClauses_;
00119 delete posGndClauses_;
00120 negGndClauses_ = new Array<GroundClause*>;
00121 posGndClauses_ = new Array<GroundClause*>;
00122 }
00123
00128 Predicate* createEquivalentPredicate(const Domain* const & domain)
00129 {
00130 const PredicateTemplate* pt = domain->getPredicateTemplate(getId());
00131 assert(pt);
00132 Predicate* pred = new Predicate(pt);
00133 for (int j = 0; j < pt->getNumTerms(); j++)
00134 pred->appendTerm(new Term(getTermId(j), (void*)pred, true));
00135 return pred;
00136 }
00137
00138 unsigned int getId() const { return (*intArrRep_)[0]; }
00139 unsigned int getTermId(const int& idx) const { return (*intArrRep_)[idx+1]; }
00140 unsigned int getNumTerms() const { return intArrRep_->size() - 1; }
00141
00142 bool getTruthValue() const { return truthValue_; }
00143 void setTruthValue(const bool& tv) { truthValue_ = tv; }
00144
00145 double getWtWhenFalse() const { return wtWhenFalse_; }
00146 void setWtWhenFalse(const double& wt) {wtWhenFalse_ = wt;}
00147 void addWtWhenFalse(const double& wt) {wtWhenFalse_ += wt;}
00148
00149 double getWtWhenTrue() const { return wtWhenTrue_; }
00150 void setWtWhenTrue(const double& wt) {wtWhenTrue_ = wt;}
00151 void addWtWhenTrue(const double& wt) {wtWhenTrue_ += wt;}
00152
00153
00154 double getProbability()
00155 { return 1.0 / ( 1.0 + exp(wtWhenFalse_ - wtWhenTrue_)); }
00156
00157
00158 void compress()
00159 {
00160 negGndClauses_->compress();
00161 posGndClauses_->compress();
00162 }
00163
00164
00165 size_t hashCode() { return hashCode_; }
00166
00167 const Array<unsigned int>* getIntArrRep() const { return intArrRep_; }
00168
00169
00170 void appendIntArrRep(Array<unsigned int>& rep) { rep.append(*intArrRep_); }
00171
00172
00173 bool appendGndClause(GroundClause* const & gc, const bool& senseInGndClause)
00174 {
00175 if (gndClauseSet_== NULL || gndClauseSet_->find(gc) == gndClauseSet_->end())
00176 {
00177 if (gndClauseSet_) gndClauseSet_->insert(gc);
00178
00179 if (senseInGndClause) posGndClauses_->append(gc);
00180 else negGndClauses_->append(gc);
00181
00182 return true;
00183 }
00184 return false;
00185 }
00186
00187 const Array<GroundClause*>* getNegGndClauses() const { return negGndClauses_;}
00188 const Array<GroundClause*>* getPosGndClauses() const { return posGndClauses_;}
00189
00190 int getNumGndClauses() const
00191 { return negGndClauses_->size() + posGndClauses_->size(); }
00192
00193
00194 bool same(const GroundPredicate* const & gp)
00195 {
00196 if (intArrRep_->size() != gp->getIntArrRep()->size()) return false;
00197 return (memcmp(intArrRep_->getItems(), gp->getIntArrRep()->getItems(),
00198 intArrRep_->size()*sizeof(unsigned int)) == 0);
00199 }
00200
00201
00202 void print(ostream& out, const Domain* const & domain) const
00203 {
00204 const char* predName = domain->getPredicateName((*intArrRep_)[0]);
00205 out << predName << "(";
00206 int size = intArrRep_->size();
00207 for (int i = 1; i < size; i++)
00208 {
00209 string name = domain->getConstantName((*intArrRep_)[i]);
00210 string::size_type at = name.rfind("@");
00211 if (at != string::npos) name = name.substr(at+1, name.length()-at-1);
00212 out << name;
00213 if (i < size-1) out << ",";
00214 else out << ")";
00215 }
00216 }
00217
00218
00219 void print(ostream& out) const
00220 {
00221 out << (*intArrRep_)[0] << "(";
00222 int size = intArrRep_->size();
00223 for (int i = 1; i < size; i++)
00224 {
00225 out << (*intArrRep_)[i];
00226 if (i < size-1) out << ",";
00227 else out << ")";
00228 }
00229 }
00230
00234 double sizeKB()
00235 {
00236 double size = 0;
00237
00238 if (intArrRep_)
00239 size += (intArrRep_->size()*sizeof(unsigned int) / 1024.0);
00240
00241 size += (sizeof(size_t) / 1024.0);
00242
00243 if (negGndClauses_)
00244 {
00245 for (int i = 0; i < negGndClauses_->size(); i++)
00246 size += ((*negGndClauses_)[i]->sizeKB());
00247 }
00248 if (posGndClauses_)
00249 {
00250 for (int i = 0; i < posGndClauses_->size(); i++)
00251 size += ((*posGndClauses_)[i]->sizeKB());
00252 }
00253
00254
00255 size += (sizeof(bool) / 1024.0);
00256
00257 size += (sizeof(double) / 1024.0);
00258
00259 size += (sizeof(double) / 1024.0);
00260
00261 return size;
00262 }
00263
00264 private:
00265
00266
00267 Array<unsigned int>* intArrRep_;
00268 size_t hashCode_;
00269
00270 Array<GroundClause*>* negGndClauses_;
00271
00272 Array<GroundClause*>* posGndClauses_;
00273
00274 GroundClauseSet* gndClauseSet_;
00275
00276
00277 bool truthValue_;
00278
00279 double wtWhenFalse_;
00280
00281 double wtWhenTrue_;
00282
00283 };
00284
00285
00287
00288
00289 class HashGroundPredicate
00290 {
00291 public:
00292 size_t operator()(GroundPredicate* const & gp) const {return gp->hashCode();}
00293 };
00294
00295
00296 class EqualGroundPredicate
00297 {
00298 public:
00299 bool operator()(GroundPredicate* const & p1, GroundPredicate* const& p2) const
00300 { return p1->same(p2); }
00301 };
00302
00304
00305 typedef hash_set<GroundPredicate*, HashGroundPredicate, EqualGroundPredicate>
00306 GroundPredicateSet;
00307
00308 typedef hash_map<GroundPredicate*, int,HashGroundPredicate,EqualGroundPredicate>
00309 GroundPredicateToIntMap;
00310
00311
00312
00313 #endif