opencog::pln::ExplicitlyEvaluatedBITNode Class Reference

#include <BackInferenceTreeNode.h>

Inheritance diagram for opencog::pln::ExplicitlyEvaluatedBITNode:

[legend]

Collaboration diagram for opencog::pln::ExplicitlyEvaluatedBITNode:

[legend]

List of all members.

Public Member Functions
BoundVertex	evaluate1 (int index)
Btr< std::set< BoundVertex > >	evaluate (std::set< const BITNode * > *chain=NULL) const
Btr< std::set< BoundVertex > >	pseudo_evaluate () const

---

Detailed Description

A BITNode results of which are produced by (slow) manual evaluation Obsolete but works. Contains interesting stats class, although the RuleApp can generate richer statistics now.

Definition at line 722 of file BackInferenceTreeNode.h.

---

Member Function Documentation

BoundVertex opencog::pln::ExplicitlyEvaluatedBITNode::evaluate1

(

int

index

)

Todo:

Complete implementation

Btr<std::set<BoundVertex> > opencog::pln::ExplicitlyEvaluatedBITNode::evaluate

(

std::set< const BITNode * > *

chain = NULL

)

const

Btr<std::set<BoundVertex> > opencog::pln::ExplicitlyEvaluatedBITNode::pseudo_evaluate

(

)

const

Use for brute force checking of whether the tree can be evaluated (but do not really evaluate).

Todo:

This may no longer be up-2-date with the real evaluate()

---

The documentation for this class was generated from the following file:

• opencog/reasoning/pln/BackInferenceTreeNode.h