1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
|
package uk.ac.ox.cs.pagoda.tracking;
import org.semanticweb.HermiT.model.*;
import uk.ac.ox.cs.pagoda.MyPrefixes;
import uk.ac.ox.cs.pagoda.hermit.DLClauseHelper;
import uk.ac.ox.cs.pagoda.multistage.Normalisation;
import uk.ac.ox.cs.pagoda.reasoner.light.BasicQueryEngine;
import uk.ac.ox.cs.pagoda.rules.UpperDatalogProgram;
import uk.ac.ox.cs.pagoda.rules.approximators.OverApproxExist;
import java.util.LinkedList;
public class TrackingRuleEncoderDisj1 extends TrackingRuleEncoderDisj {
public TrackingRuleEncoderDisj1(UpperDatalogProgram program, BasicQueryEngine store) {
super(program, store);
}
@Override
public boolean encodingRules() {
if (super.encodingRules()) {
processDisjunctiveRules();
return true;
}
return false;
}
@Override
protected void encodingRule(DLClause clause) {
if (currentQuery.isBottom()) {
super.encodingRule(clause);
return ;
}
DLClause original = program.getCorrespondingClause(clause);
if (original.getHeadLength() <= 1) {
super.encodingRule(clause);
}
else addDisjunctiveRule(original, clause);
}
private DLPredicate getAuxPredicate(DLPredicate p, Individual... individuals) {
if (p instanceof AtLeastConcept) {
StringBuilder builder = new StringBuilder(
Normalisation.getAuxiliaryConcept4Disjunct((AtLeastConcept) p, individuals));
builder.append("_AUXa").append(currentQuery.getQueryID());
return AtomicConcept.create(builder.toString());
}
return getDLPredicate(p, "_AUXa" + currentQuery.getQueryID());
}
private DLPredicate getTrackingBottomDLPredicate(DLPredicate p) {
return getDLPredicate(p, getTrackingSuffix("0"));
}
protected DLPredicate generateAuxiliaryRule(AtLeastConcept p, DLClause original, Individual[] individuals) {
DLPredicate ret = getAuxPredicate(p, individuals);
Atom[] headAtom = new Atom[] {Atom.create(ret, X)};
AtomicRole role = p.getOnRole() instanceof AtomicRole ?
(AtomicRole) p.getOnRole():
((InverseRole) p.getOnRole()).getInverseOf();
AtomicConcept concept = p.getToConcept() instanceof AtomicConcept ?
(AtomicConcept) p.getToConcept() :
OverApproxExist.getNegationConcept(((AtomicNegationConcept) p.getToConcept()).getNegatedAtomicConcept());
Term[] roleArgs, conceptArg;
for (Individual i: individuals) {
// Variable i = Variable.create("Y");
if (p.getOnRole() instanceof AtomicRole) {
roleArgs = new Term[] {X, i};
conceptArg = new Term[] {i};
}
else {
roleArgs = new Term[] {i, X};
conceptArg = new Term[] {i};
}
addTrackingClause(
DLClause.create(headAtom,
new Atom[] {Atom.create(getTrackingDLPredicate(role), roleArgs)}));
addTrackingClause(
DLClause.create(headAtom,
new Atom[] {Atom.create(getTrackingBottomDLPredicate(role), roleArgs)}));
Atom guard = Atom.create(role, roleArgs);
if (!concept.equals(AtomicConcept.THING)) {
addTrackingClause(
DLClause.create(headAtom,
new Atom[] {guard, Atom.create(getTrackingDLPredicate(concept), conceptArg)}));
addTrackingClause(
DLClause.create(headAtom,
new Atom[] {guard, Atom.create(getTrackingBottomDLPredicate(concept), conceptArg)}));
}
}
return ret;
}
protected DLPredicate generateAuxiliaryRule(AtomicRole p) {
DLPredicate ret = getAuxPredicate(p);
Atom[] headAtom = new Atom[] {Atom.create(ret, X, Y)};
addTrackingClause(
DLClause.create(headAtom, new Atom[] {Atom.create(getTrackingDLPredicate(p), X, Y)}));
addTrackingClause(
DLClause.create(headAtom, new Atom[] {Atom.create(getTrackingBottomDLPredicate(p), X, Y)}));
return ret;
}
private Variable X = Variable.create("X"), Y = Variable.create("Y");
protected DLPredicate generateAuxiliaryRule(AtomicConcept p) {
DLPredicate ret = getAuxPredicate(p);
Atom[] headAtom = new Atom[] {Atom.create(ret, X)};
addTrackingClause(
DLClause.create(headAtom,
new Atom[] { Atom.create(getTrackingDLPredicate(p), X)}));
addTrackingClause(
DLClause.create(headAtom,
new Atom[] { Atom.create(getTrackingBottomDLPredicate(p), X)}));
return ret;
}
protected DLPredicate generateAuxiliaryRule(Inequality instance) {
// TODO:
return null;
}
@Override
public boolean isAuxPredicate(String iri) {
return iri.contains("_AUXa");
// if (iri.startsWith("<"))
// return iri.endsWith("_AUXa" + currentQuery.getQueryID() + ">");
// return iri.endsWith("_AUXa" + currentQuery.getQueryID());
}
@Override
public String getTrackingProgram() {
StringBuilder sb = getTrackingProgramBody();
if (currentQuery.isBottom())
sb.append(getBottomTrackingProgram());
sb.insert(0, MyPrefixes.PAGOdAPrefixes.prefixesText());
return sb.toString();
}
private String bottomTrackingProgram = null;
private String getBottomTrackingProgram() {
if (bottomTrackingProgram != null) return bottomTrackingProgram.replace("_tn", getTrackingPredicate(""));
String bottomSuffix = getTrackingSuffix("0");
LinkedList<DLClause> clauses = new LinkedList<DLClause>();
Variable X = Variable.create("X");
for (String concept: unaryPredicates)
clauses.add(DLClause.create(new Atom[] {Atom.create(AtomicConcept.create(concept + bottomSuffix) , X)},
new Atom[] {Atom.create(AtomicConcept.create(concept + "_tn"), X)}));
Variable Y = Variable.create("Y");
for (String role: binaryPredicates)
clauses.add(DLClause.create(new Atom[] {Atom.create(AtomicRole.create(role + bottomSuffix) , X, Y)},
new Atom[] {Atom.create(AtomicRole.create(role + "_tn"), X, Y) }));
StringBuilder builder = new StringBuilder(DLClauseHelper.toString(clauses));
bottomTrackingProgram = builder.toString();
return bottomTrackingProgram.replace("_tn", getTrackingPredicate(""));
}
}
|
