public class InterprNode extends Object implements Comparable<InterprNode>
InterprNode class represents a node within the interpretations lattice. Such a node consists of a conjunction of
primitive interpretation nodes that are emitted during each activation of a Neuron (but not the InputNeurons).
The primitive nodes them self can consist of a disjunction of other interpretation nodes.
For example the primitive interpretation node 9[(1),(6,7,8)] has the primitive node id 9 and consists of the disjunction of the interpretation nodes (1) and (6,7,8).
These conjunctions and disjunction in the interpretation representation is necessary since the logic layer underneath each neuron too consists of conjunctions and disjunctions.
There may be conflicts between interpretation nodes in the lattice. Conflicts are generated by negative recurrent synapses.| Modifier and Type | Class and Description |
|---|---|
static class |
InterprNode.Relation |
| Modifier and Type | Field and Description |
|---|---|
NavigableMap<Activation.Key,Activation> |
activations |
InterprNode[] |
children |
Conflicts |
conflicts |
Document |
doc |
Boolean |
hasUnsatisfiedPosFeedbackLinksCache |
int |
id |
int |
isConflict |
boolean |
isRemoved |
InterprNode |
largestCommonSubset |
int |
length |
Set<InterprNode> |
linkedByLCS |
long |
markedConflict |
long |
markedCovered |
long |
markedExcluded |
long |
markedExpandRefinement |
static InterprNode |
MAX |
int |
maxPrim |
static InterprNode |
MIN |
int |
minPrim |
NavigableSet<Activation> |
neuronActivations |
Map<Activation,InterprNode> |
orInterprNodes |
InterprNode[] |
parents |
int |
primId |
Set<InterprNode> |
refByOrInterprNode |
int |
refCount |
int |
removedId |
static int |
removedIdCounter |
long |
visitedCheckExcluded |
long |
visitedCollectAllConflicting |
long |
visitedCollectConflicts |
static long |
visitedCounter |
long |
visitedExpandRefinementRecursiveStep |
long |
visitedMarkCovered |
| Constructor and Description |
|---|
InterprNode(Document doc,
int primId,
int id) |
InterprNode(Document doc,
int primId,
int id,
int length) |
public static final InterprNode MIN
public static final InterprNode MAX
public final int primId
public int minPrim
public int maxPrim
public final int id
public int length
public Map<Activation,InterprNode> orInterprNodes
public Set<InterprNode> refByOrInterprNode
public InterprNode largestCommonSubset
public Set<InterprNode> linkedByLCS
public long visitedMarkCovered
public long markedCovered
public long markedExcluded
public long visitedCollectAllConflicting
public long visitedExpandRefinementRecursiveStep
public long markedExpandRefinement
public long visitedCollectConflicts
public long visitedCheckExcluded
public long markedConflict
public Boolean hasUnsatisfiedPosFeedbackLinksCache
public static long visitedCounter
public final Document doc
public boolean isRemoved
public int removedId
public static int removedIdCounter
public InterprNode[] parents
public InterprNode[] children
public int isConflict
public Conflicts conflicts
public NavigableMap<Activation.Key,Activation> activations
public NavigableSet<Activation> neuronActivations
public int refCount
public InterprNode(Document doc, int primId, int id, int length)
public InterprNode(Document doc, int primId, int id)
public void computeLargestCommonSubset()
public void computeLargestCommonSubsetIncremental(InterprNode no)
public void addOrOption(Activation inputAct, InterprNode n)
public void removeOrOption(Activation inputAct, InterprNode n)
public void countRef()
public void releaseRef()
public Collection<Activation> getActivations()
public Collection<Activation> getNeuronActivations()
public static InterprNode add(Document doc, boolean nonConflicting, InterprNode... input)
public static InterprNode add(Document doc, boolean nonConflicting, List<InterprNode> inputs)
public static void computeRelations(List<InterprNode> parentsResults, List<InterprNode> childrenResults, List<InterprNode> inputs)
public static void addLink(InterprNode a, InterprNode b)
public static void removeLink(InterprNode a, InterprNode b)
public static InterprNode addPrimitive(Document doc)
public boolean isBottom()
public boolean contains(boolean dir,
InterprNode n,
boolean followLCS)
public boolean contains(InterprNode n, boolean followLCS)
public void collectConflicts(Set<InterprNode> conflicts, long v)
public boolean isConflicting(long v)
public boolean conflictsAllowed()
public void storeFinalWeight(long v)
public int compareTo(InterprNode n)
compareTo in interface Comparable<InterprNode>public static int compare(InterprNode oa, InterprNode ob)
Copyright © 2017. All rights reserved.