blob: 5339c50e0b790149a5faa3f1dc464c29b7ec9f0f (
plain) (
blame)
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
|
package uk.ac.ox.cs.pagoda.constraints;
import java.util.Collection;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Set;
import org.semanticweb.HermiT.model.Atom;
import org.semanticweb.HermiT.model.AtomicConcept;
import org.semanticweb.HermiT.model.DLClause;
import org.semanticweb.HermiT.model.Individual;
import org.semanticweb.HermiT.model.Term;
import org.semanticweb.HermiT.model.Variable;
public class UnaryBottom implements BottomStrategy {
@Override
public Collection<DLClause> process(Collection<DLClause> clauses) {
Collection<DLClause> ret = new LinkedList<DLClause>();
for (DLClause clause: clauses)
if (clause.getHeadLength() == 0) {
ret.add(DLClause.create(getEmptyHead(pickRepresentative(clause.getBodyAtoms())), clause.getBodyAtoms()));
}
else
ret.add(clause);
return ret;
}
protected Term pickRepresentative(Atom[] atoms) {
Term rep = null;
Set<Variable> vars = new HashSet<Variable>();
for (Atom atom: atoms) {
atom.getVariables(vars);
for (Variable v: vars)
if (rep == null || ((Variable) rep).getName().compareTo(v.getName()) > 0)
rep = v;
vars.clear();
}
if (rep != null) return rep;
Set<Individual> inds = new HashSet<Individual>();
for (Atom atom: atoms) {
atom.getIndividuals(inds);
for (Individual i: inds)
if (rep == null || ((Individual) rep).getIRI().compareTo(i.getIRI()) > 0)
rep = i;
inds.clear();
}
return rep;
}
@Override
public boolean isBottomRule(DLClause clause) {
return clause.getHeadLength() == 1 && clause.getHeadAtom(0).getDLPredicate().equals(AtomicConcept.NOTHING);
}
public Atom[] getEmptyHead(Term t) {
return new Atom[] {Atom.create(AtomicConcept.NOTHING, t)};
}
@Override
public int getBottomNumber() {
return 1;
}
}
|