本文整理汇总了C++中TBox::getTree方法的典型用法代码示例。如果您正苦于以下问题：C++ TBox::getTree方法的具体用法？C++ TBox::getTree怎么用？C++ TBox::getTree使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类TBox的用法示例。
在下文中一共展示了TBox::getTree方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: absorbIntoNegConcept
/// absorb into negation of a concept; @return true if absorption is performed
bool
TAxiom :: absorbIntoNegConcept ( TBox& KB ) const
{
WorkSet Cons;
TConcept* Concept;
const DLTree* bestConcept = NULL;
// finds all primitive negated concept names without description
for ( const_iterator p = begin(), p_end = end(); p != p_end; ++p )
if ( (*p)->Element().getToken() == NOT && isName((*p)->Left())
&& (Concept = InAx::getConcept((*p)->Left()))->isPrimitive()
&& !Concept->isSingleton() && Concept->Description == NULL )
{
Stat::SAbsNAttempt();
Cons.push_back(*p);
}
// if no concept names -- return;
if ( Cons.empty() )
return false;
Stat::SAbsNApply();
// FIXME!! as for now: just take the 1st concept name
if ( bestConcept == NULL )
bestConcept = Cons[0];
// normal concept absorption
Concept = InAx::getConcept(bestConcept->Left());
#ifdef RKG_DEBUG_ABSORPTION
std::cout << " N-Absorb GCI to concept " << Concept->getName();
if ( Cons.size() > 1 )
{
std::cout << " (other options are";
for ( WorkSet::iterator q = Cons.begin(), q_end = Cons.end(); q != q_end; ++q )
if ( *q != bestConcept )
std::cout << " " << InAx::getConcept((*q)->Left())->getName();
std::cout << ")";
}
#endif
// replace ~C [= D with C=~notC, notC [= D:
// make notC [= D
TConcept* nC = KB.getAuxConcept(createAnAxiom(bestConcept));
// define C = ~notC; C had an empty desc, so it's safe not to delete it
KB.makeNonPrimitive ( Concept, createSNFNot(KB.getTree(nC)) );
return true;
}