| Package | Description |
|---|---|
| uk.ac.manchester.cs.jfact.helpers | |
| uk.ac.manchester.cs.jfact.kernel | |
| uk.ac.manchester.cs.jfact.kernel.modelcaches |
| Modifier and Type | Method and Description |
|---|---|
void |
DLVertex.sortEntry(DLDag dag) |
| Constructor and Description |
|---|
DLVertex(DagTag op,
DLDag heap)
c'tor for Top/CN/And (before adding any operands)
|
DLVertex(DagTag op,
int m,
Role r,
int c,
Role projR,
DLDag heap)
c'tor for max n R_C; and for \A R{n}_C; Note order C, n, R.pointer
|
| Modifier and Type | Method and Description |
|---|---|
DLDag |
TBox.getDag() |
DLDag |
DlSatTester.getDAG() |
DLDag |
TBox.getDLHeap() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
DlCompletionTree.isBlockedBySHI(DLDag dag,
DlCompletionTree p) |
boolean |
DlCompletionTree.isBlockedBySHIQ(DLDag dag,
DlCompletionTree p) |
| Constructor and Description |
|---|
TDag2Interface(DLDag dag,
ExpressionCache manager)
init c'tor
|
| Constructor and Description |
|---|
ModelCacheIan(DLDag heap,
DlCompletionTree p,
boolean flagNominals,
int nC,
int nR,
JFactReasonerConfiguration simpleRules)
Create cache model of given CompletionTree using given HEAP
|
Copyright © 2018 The University of Manchester. All rights reserved.