uk.ac.manchester.cs.jfact.kernel

Class DlCompletionGraph

java.lang.Object

uk.ac.manchester.cs.jfact.kernel.DlCompletionGraph

All Implemented Interfaces:

Serializable

@PortedFrom(file="dlCompletionGraph.h",
            name="DlCompletionGraph")
public class DlCompletionGraph
extends Object
implements Serializable

completion graph

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor and Description
DlCompletionGraph(int initSize, DlSatTester p) c'tor: make INIT_SIZE objects

Method Summary

Modifier and Type	Method and Description
void	addConceptToNode(DlCompletionTree node, ConceptWDep c, DagTag tag) add concept C of a type TAG to NODE; call blocking check if appropriate
DlCompletionTreeArc	addRoleLabel(DlCompletionTree from, DlCompletionTree to, boolean isPredEdge, Role r, DepSet dep) add role R with dep-set DEP to the label of the TO arc
void	clear() mark all heap elements as unused
void	clearStatistics() clear all the session statistics
DlCompletionTreeArc	createLoop(DlCompletionTree node, Role r, DepSet dep) Create an R-loop of NODE wrt dep-set DEP;
DlCompletionTreeArc	createNeighbour(DlCompletionTree from, boolean isPredEdge, Role r, DepSet dep) Create an empty R-neighbour of FROM;
void	detectBlockedStatus(DlCompletionTree node)
void	finiIR() fini IR
DlCompletionTree	getFCViolator(int c)
DlCompletionTree	getNewNode()
DlCompletionTree	getNode(int i)
SaveStackRare	getRareStack() get the rare stack
DlCompletionTree	getRoot()
void	initContext(int nSkip, boolean useLB, boolean useAB) set flags for blocking
void	initIR() init IR
int	maxSize()
void	merge(DlCompletionTree from, DlCompletionTree to, DepSet dep, List<DlCompletionTreeArc> edges) merge labels; see SHOIN paper for detailed description
java.util.stream.Stream<DlCompletionTree>	nodes()
boolean	nonMergable(DlCompletionTree p, DlCompletionTree q, Reference<DepSet> dep)
void	print(LogAdapter o)
void	restore(int level)
void	retestCGBlockedStatus() retest every d-blocked node in the CG.
void	save() save dl completion graph
void	saveNode(DlCompletionTree node, int level) save given node wrt level
void	saveRareCond(List<Restorer> l)
void	saveRareCond(Restorer p) save rarely appeared info if P is non-null
void	setBlockingMethod(boolean hasInverse, boolean hasQCR) set blocking method for a session
boolean	setCurIR(DlCompletionTree node, DepSet ds)
void	updateDBlockedStatus(DlCompletionTree node) update blocked status for d-blocked node

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

DlCompletionGraph

public DlCompletionGraph(int initSize,
                         DlSatTester p)

c'tor: make INIT_SIZE objects

Parameters:

initSize - initSize

p - p

Method Detail

initContext

@PortedFrom(file="dlCompletionGraph.h",
            name="initContext")
public void initContext(int nSkip,
                                                                                                boolean useLB,
                                                                                                boolean useAB)

set flags for blocking

Parameters:

nSkip - nSkip

useLB - useLB

useAB - useAB

setBlockingMethod

@PortedFrom(file="dlCompletionGraph.h",
            name="setBlockingMethod")
public void setBlockingMethod(boolean hasInverse,
                                                                                                            boolean hasQCR)

set blocking method for a session

Parameters:

hasInverse - hasInverse

hasQCR - hasQCR

addConceptToNode

@PortedFrom(file="dlCompletionGraph.h",
            name="addConceptToNode")
public void addConceptToNode(DlCompletionTree node,
                                                                                                          ConceptWDep c,
                                                                                                          DagTag tag)

add concept C of a type TAG to NODE; call blocking check if appropriate

Parameters:

node - node

c - c

tag - tag

getRoot

@PortedFrom(file="dlCompletionGraph.h",
            name="getRoot")
public DlCompletionTree getRoot()

Returns:

root node (non-const)

getNode

@Nullable
 @PortedFrom(file="dlCompletionGraph.h",
            name="getNode")
public DlCompletionTree getNode(int i)

Parameters:

i - i

Returns:

dl completion tree at index i

nodes

@PortedFrom(file="dlCompletionGraph.h",
            name="getNode")
public java.util.stream.Stream<DlCompletionTree> nodes()

Returns:

stream of nodes

getNewNode

@PortedFrom(file="dlCompletionGraph.h",
            name="getNewNode")
public DlCompletionTree getNewNode()

Returns:

new node (with internal level)

updateDBlockedStatus

@PortedFrom(file="dlCompletionGraph.h",
            name="updateDBlockedStatus")
public void updateDBlockedStatus(DlCompletionTree node)

update blocked status for d-blocked node

Parameters:

node - node

retestCGBlockedStatus

@PortedFrom(file="dlCompletionGraph.h",
            name="retestCGBlockedStatus")
public void retestCGBlockedStatus()

retest every d-blocked node in the CG. Use it after the CG was build

getFCViolator

@Nullable
 @PortedFrom(file="dlCompletionGraph.h",
            name="getFCViolator")
public DlCompletionTree getFCViolator(int c)

Parameters:

c - fairness constant

Returns:

true if a fairness constraint C is violated in one of the loops in the CGraph

clearStatistics

@PortedFrom(file="dlCompletionGraph.h",
            name="clearStatistics")
public void clearStatistics()

clear all the session statistics

maxSize

@PortedFrom(file="dlCompletionGraph.h",
            name="maxSize")
public int maxSize()

Returns:

get number of nodes in the CGraph

clear

@PortedFrom(file="dlCompletionGraph.h",
            name="clear")
public void clear()

mark all heap elements as unused

saveRareCond

@PortedFrom(file="dlCompletionGraph.h",
            name="saveRareCond")
public void saveRareCond(@Nullable
                                                                                                  Restorer p)

save rarely appeared info if P is non-null

Parameters:

p - p

saveRareCond

@PortedFrom(file="dlCompletionGraph.h",
            name="saveRareCond")
public void saveRareCond(List<Restorer> l)

Parameters:

l - restorers to save

getRareStack

public SaveStackRare getRareStack()

get the rare stack

Returns:

rare stack

addRoleLabel

@PortedFrom(file="dlCompletionGraph.h",
            name="addRoleLabel")
public DlCompletionTreeArc addRoleLabel(DlCompletionTree from,
                                                                                                                 DlCompletionTree to,
                                                                                                                 boolean isPredEdge,
                                                                                                                 Role r,
                                                                                                                 DepSet dep)

add role R with dep-set DEP to the label of the TO arc

Parameters:

from - from

to - to

isPredEdge - isPredEdge

r - name of role (arc label)

dep - dep-set of the arc label

Returns:

completion tree arc

createNeighbour

@PortedFrom(file="dlCompletionGraph.h",
            name="createNeighbour")
public DlCompletionTreeArc createNeighbour(DlCompletionTree from,
                                                                                                                       boolean isPredEdge,
                                                                                                                       Role r,
                                                                                                                       DepSet dep)

Create an empty R-neighbour of FROM;

Parameters:

from - from

isPredEdge - isPredEdge

r - name of role (arc label)

dep - dep-set of the arc label

Returns:

an edge to created node

createLoop

@PortedFrom(file="dlCompletionGraph.h",
            name="createLoop")
public DlCompletionTreeArc createLoop(DlCompletionTree node,
                                                                                                             Role r,
                                                                                                             DepSet dep)

Create an R-loop of NODE wrt dep-set DEP;

Parameters:

node - node

r - r

dep - dep

Returns:

a loop edge

saveNode

@PortedFrom(file="dlCompletionGraph.h",
            name="saveNode")
public void saveNode(DlCompletionTree node,
                                                                                          int level)

save given node wrt level

Parameters:

node - node

level - level

detectBlockedStatus

@PortedFrom(file="dlCompletionGraph.h",
            name="detectBlockedStatus")
public void detectBlockedStatus(DlCompletionTree node)

Parameters:

node - node

nonMergable

@PortedFrom(file="dlCompletionGraph.h",
            name="nonMergable")
public boolean nonMergable(DlCompletionTree p,
                                                                                                   DlCompletionTree q,
                                                                                                   Reference<DepSet> dep)

Parameters:

p - p

q - q

dep - dep

Returns:

whether p and q can be merged

initIR

@PortedFrom(file="dlCompletionGraph.h",
            name="initIR")
public void initIR()

init IR

setCurIR

@PortedFrom(file="dlCompletionGraph.h",
            name="setCurIR")
public boolean setCurIR(DlCompletionTree node,
                                                                                             DepSet ds)

Parameters:

node - node

ds - ds

Returns:

true if IR alreadh has the label

finiIR

@PortedFrom(file="dlCompletionGraph.h",
            name="finiIR")
public void finiIR()

fini IR

merge

@PortedFrom(file="dlCompletionGraph.h",
            name="merge")
public void merge(DlCompletionTree from,
                                                                                    DlCompletionTree to,
                                                                                    DepSet dep,
                                                                                    List<DlCompletionTreeArc> edges)

merge labels; see SHOIN paper for detailed description

Parameters:

from - from

to - to

dep - dep

edges - edges

save

@PortedFrom(file="dlCompletionGraph.h",
            name="save")
public void save()

save dl completion graph

restore

@PortedFrom(file="dlCompletionGraph.h",
            name="restore")
public void restore(int level)

Parameters:

level - level

print

@PortedFrom(file="dlCompletionGraph.h",
            name="print")
public void print(LogAdapter o)

Parameters:

o - o