org.aika.corpus

Class InterprNode

java.lang.Object

org.aika.corpus.InterprNode

All Implemented Interfaces:

Comparable<InterprNode>

public class InterprNode
extends Object
implements Comparable<InterprNode>

The 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.

Author:

Lukas Molzberger

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	InterprNode.Relation

Field Summary

Fields

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 Summary

Constructors

Constructor and Description
InterprNode(Document doc, int primId, int id)
InterprNode(Document doc, int primId, int id, int length)

Method Summary

Modifier and Type	Method and Description
static InterprNode	add(Document doc, boolean nonConflicting, InterprNode... input)
static InterprNode	add(Document doc, boolean nonConflicting, List<InterprNode> inputs)
static void	addLink(InterprNode a, InterprNode b)
void	addOrOption(Activation inputAct, InterprNode n)
static InterprNode	addPrimitive(Document doc)
void	collectConflicts(Set<InterprNode> conflicts, long v)
static int	compare(InterprNode oa, InterprNode ob)
int	compareTo(InterprNode n)
void	computeLargestCommonSubset()
void	computeLargestCommonSubsetIncremental(InterprNode no)
static void	computeRelations(List<InterprNode> parentsResults, List<InterprNode> childrenResults, List<InterprNode> inputs)
boolean	conflictsAllowed()
boolean	contains(boolean dir, InterprNode n, boolean followLCS)
boolean	contains(InterprNode n, boolean followLCS)
void	countRef()
Collection<Activation>	getActivations()
Collection<Activation>	getNeuronActivations()
boolean	isBottom()
boolean	isConflicting(long v)
void	releaseRef()
static void	removeLink(InterprNode a, InterprNode b)
void	removeOrOption(Activation inputAct, InterprNode n)
void	storeFinalWeight(long v)
String	toString()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Field Detail

MIN

public static final InterprNode MIN

MAX

public static final InterprNode MAX

primId

public final int primId

minPrim

public int minPrim

maxPrim

public int maxPrim

id

public final int id

length

public int length

orInterprNodes

public Map<Activation,InterprNode> orInterprNodes

refByOrInterprNode

public Set<InterprNode> refByOrInterprNode

largestCommonSubset

public InterprNode largestCommonSubset

linkedByLCS

public Set<InterprNode> linkedByLCS

visitedMarkCovered

public long visitedMarkCovered

markedCovered

public long markedCovered

markedExcluded

public long markedExcluded

visitedCollectAllConflicting

public long visitedCollectAllConflicting

visitedExpandRefinementRecursiveStep

public long visitedExpandRefinementRecursiveStep

markedExpandRefinement

public long markedExpandRefinement

visitedCollectConflicts

public long visitedCollectConflicts

visitedCheckExcluded

public long visitedCheckExcluded

markedConflict

public long markedConflict

hasUnsatisfiedPosFeedbackLinksCache

public Boolean hasUnsatisfiedPosFeedbackLinksCache

visitedCounter

public static long visitedCounter

doc

public final Document doc

isRemoved

public boolean isRemoved

removedId

public int removedId

removedIdCounter

public static int removedIdCounter

parents

public InterprNode[] parents

children

public InterprNode[] children

isConflict

public int isConflict

conflicts

public Conflicts conflicts

activations

public NavigableMap<Activation.Key,Activation> activations

neuronActivations

public NavigableSet<Activation> neuronActivations

refCount

public int refCount

Constructor Detail

InterprNode

public InterprNode(Document doc,
                   int primId,
                   int id,
                   int length)

InterprNode

public InterprNode(Document doc,
                   int primId,
                   int id)

Method Detail

computeLargestCommonSubset

public void computeLargestCommonSubset()

computeLargestCommonSubsetIncremental

public void computeLargestCommonSubsetIncremental(InterprNode no)

addOrOption

public void addOrOption(Activation inputAct,
                        InterprNode n)

removeOrOption

public void removeOrOption(Activation inputAct,
                           InterprNode n)

countRef

public void countRef()

releaseRef

public void releaseRef()

getActivations

public Collection<Activation> getActivations()

getNeuronActivations

public Collection<Activation> getNeuronActivations()

add

public static InterprNode add(Document doc,
                              boolean nonConflicting,
                              InterprNode... input)

add

public static InterprNode add(Document doc,
                              boolean nonConflicting,
                              List<InterprNode> inputs)

computeRelations

public static void computeRelations(List<InterprNode> parentsResults,
                                    List<InterprNode> childrenResults,
                                    List<InterprNode> inputs)

addLink

public static void addLink(InterprNode a,
                           InterprNode b)

removeLink

public static void removeLink(InterprNode a,
                              InterprNode b)

addPrimitive

public static InterprNode addPrimitive(Document doc)

isBottom

public boolean isBottom()

contains

public boolean contains(boolean dir,
                        InterprNode n,
                        boolean followLCS)

contains

public boolean contains(InterprNode n,
                        boolean followLCS)

collectConflicts

public void collectConflicts(Set<InterprNode> conflicts,
                             long v)

isConflicting

public boolean isConflicting(long v)

conflictsAllowed

public boolean conflictsAllowed()

storeFinalWeight

public void storeFinalWeight(long v)

toString

public String toString()

Overrides:

toString in class Object

compareTo

public int compareTo(InterprNode n)

Specified by:

compareTo in interface Comparable<InterprNode>

compare

public static int compare(InterprNode oa,
                          InterprNode ob)