public String maxCardinalityExplanation() { return describeNode(getNode()) + " has more than " + _args[1] + " values for property " + _args[0] + " violating the cardinality restriction"; }
public String maxCardinalityExplanation() { return describeNode(getNode()) + " has more than " + _args[1] + " values for property " + _args[0] + " violating the cardinality restriction"; }
public String bottomExplanation() { return describeNode(getNode()) + " has " + _args[0] + " property"; }
public String bottomExplanation() { return describeNode(getNode()) + " has " + _args[0] + " property"; }
public String atomicExplanation() { return describeNode(getNode()) + " is forced to belong to class " + _args[0] + " and its complement"; }
public String nominalExplanation() { return describeNode(getNode()) + " is sameAs and differentFrom " + _args[0] + " at the same time "; }
public String functionalCardinalityExplanation() { return describeNode(getNode()) + " has more than " + "one value for the functional property " + _args[0]; }
public String atomicExplanation() { return describeNode(getNode()) + " is forced to belong to class " + _args[0] + " and its complement"; }
public String functionalCardinalityExplanation() { return describeNode(getNode()) + " has more than " + "one value for the functional property " + _args[0]; }
public String nominalExplanation() { return describeNode(getNode()) + " is sameAs and differentFrom " + _args[0] + " at the same time "; }
/** * Equals method */ @Override public boolean equals(final Object other) { if (other instanceof ClashDependency) return _assertion.equals(((ClashDependency) other)._assertion) && _clash.getNode().equals(((ClashDependency) other)._clash.getNode()) && _clash.getType() == ((ClashDependency) other)._clash.getType() && _clash.getDepends().equals(((ClashDependency) other)._clash.getDepends()); else return false; }
/** * Equals method */ @Override public boolean equals(final Object other) { if (other instanceof ClashDependency) return _assertion.equals(((ClashDependency) other)._assertion) && _clash.getNode().equals(((ClashDependency) other)._clash.getNode()) && _clash.getType() == ((ClashDependency) other)._clash.getType() && _clash.getDepends().equals(((ClashDependency) other)._clash.getDepends()); else return false; }
@Override public String toString() { return "[Clash " + getNode() + " " + getType() + " " + getDepends().toString() + (_args == null ? "" : " " + Arrays.asList(_args)) + "]"; }
@Override public String toString() { return "[Clash " + getNode() + " " + getType() + " " + getDepends().toString() + (_args == null ? "" : " " + Arrays.asList(_args)) + "]"; }
/** * Hashcode method TODO: this may not be sufficient */ @Override public int hashCode() { return _clash.getType().hashCode() + _clash.getDepends().hashCode() + _clash.getNode().hashCode() + _assertion.hashCode(); }
/** * Hashcode method TODO: this may not be sufficient */ @Override public int hashCode() { return _clash.getType().hashCode() + _clash.getDepends().hashCode() + _clash.getNode().hashCode() + _assertion.hashCode(); }
final Node node = clash.getNode(); final ATermAppl term = clash._args != null ? (ATermAppl) clash._args[0] : null;
final Node node = clash.getNode(); final ATermAppl term = clash._args != null ? (ATermAppl) clash._args[0] : null;
public Clash copyTo(final ABoxImpl abox) { return new Clash(abox.getNode(getNode().getName()), getType(), getDepends(), _clashExplanation); }
public Clash copyTo(final ABoxImpl abox) { return new Clash(abox.getNode(getNode().getName()), getType(), getDepends(), _clashExplanation); }