diff options
| author | RncLsn <rnc.lsn@gmail.com> | 2015-05-13 11:57:06 +0100 |
|---|---|---|
| committer | RncLsn <rnc.lsn@gmail.com> | 2015-05-13 11:57:06 +0100 |
| commit | 7e0ecc07285209e65f9d4d022065d06a4997fc86 (patch) | |
| tree | 3c3faa6684e49444c7078903d2e5762fc44bb3a6 /src/uk/ac/ox/cs/pagoda/rules/Approximator.java | |
| parent | 0c2726db44b562cbda9bfa87e76d829927c31ec8 (diff) | |
| download | ACQuA-7e0ecc07285209e65f9d4d022065d06a4997fc86.tar.gz ACQuA-7e0ecc07285209e65f9d4d022065d06a4997fc86.zip | |
Implementing Limited Skolemisation, in particular SkolemTermsDispenser.
Diffstat (limited to 'src/uk/ac/ox/cs/pagoda/rules/Approximator.java')
| -rw-r--r-- | src/uk/ac/ox/cs/pagoda/rules/Approximator.java | 62 |
1 files changed, 0 insertions, 62 deletions
diff --git a/src/uk/ac/ox/cs/pagoda/rules/Approximator.java b/src/uk/ac/ox/cs/pagoda/rules/Approximator.java deleted file mode 100644 index 66e676b..0000000 --- a/src/uk/ac/ox/cs/pagoda/rules/Approximator.java +++ /dev/null | |||
| @@ -1,62 +0,0 @@ | |||
| 1 | package uk.ac.ox.cs.pagoda.rules; | ||
| 2 | |||
| 3 | import org.semanticweb.HermiT.model.AtLeast; | ||
| 4 | import org.semanticweb.HermiT.model.Atom; | ||
| 5 | import org.semanticweb.HermiT.model.DLClause; | ||
| 6 | import org.semanticweb.HermiT.model.DLPredicate; | ||
| 7 | |||
| 8 | import java.util.Collection; | ||
| 9 | import java.util.LinkedList; | ||
| 10 | |||
| 11 | public interface Approximator { | ||
| 12 | |||
| 13 | Collection<DLClause> convert(DLClause clause, DLClause originalClause); | ||
| 14 | |||
| 15 | } | ||
| 16 | |||
| 17 | class IgnoreExist implements Approximator { | ||
| 18 | |||
| 19 | @Override | ||
| 20 | public Collection<DLClause> convert(DLClause clause, DLClause originalClause) { | ||
| 21 | Collection<DLClause> ret = new LinkedList<DLClause>(); | ||
| 22 | DLPredicate p; | ||
| 23 | for (Atom headAtom: clause.getHeadAtoms()) { | ||
| 24 | p = headAtom.getDLPredicate(); | ||
| 25 | if (p instanceof AtLeast) return ret; | ||
| 26 | } | ||
| 27 | |||
| 28 | ret.add(clause); | ||
| 29 | return ret; | ||
| 30 | } | ||
| 31 | |||
| 32 | } | ||
| 33 | |||
| 34 | class IgnoreBoth implements Approximator { | ||
| 35 | |||
| 36 | @Override | ||
| 37 | public Collection<DLClause> convert(DLClause clause, DLClause originalClause) { | ||
| 38 | Collection<DLClause> ret = new LinkedList<DLClause>(); | ||
| 39 | |||
| 40 | if (clause.getHeadLength() > 1) return ret; | ||
| 41 | |||
| 42 | if (clause.getHeadLength() > 0) { | ||
| 43 | DLPredicate predicate = clause.getHeadAtom(0).getDLPredicate(); | ||
| 44 | |||
| 45 | if (predicate instanceof AtLeast) return ret; | ||
| 46 | } | ||
| 47 | |||
| 48 | ret.add(clause); | ||
| 49 | return ret; | ||
| 50 | } | ||
| 51 | } | ||
| 52 | |||
| 53 | class IgnoreDisj implements Approximator { | ||
| 54 | |||
| 55 | @Override | ||
| 56 | public Collection<DLClause> convert(DLClause clause, DLClause originalClause) { | ||
| 57 | Collection<DLClause> ret = new LinkedList<DLClause>(); | ||
| 58 | if (clause.getHeadLength() > 1) return ret; | ||
| 59 | ret.add(clause); | ||
| 60 | return ret; | ||
| 61 | } | ||
| 62 | } | ||
