Is the following TBox cyclic or acyclic? If it is a cyclic TBox, how could it be converted to an acyclic one?
A ⊑ ¬E
E ⊑ ¬A
Is the following TBox cyclic or acyclic? If it is a cyclic TBox, how could it be converted to an acyclic one?
A ⊑ ¬E
E ⊑ ¬A
A ⊑ ¬E
E ⊑ ¬A
This TBox doesn't really say anything except that the classes A and E are disjoint. The subclass relations could be read as implications:
To express disjointness in description logics, you'd typically say that the intersection of disjoint classes is equivalent, or a subclass, of the bottom concept, ⊥, which by definition has no instances. &bot is also the complement of the top concept, ⊤, which contains everything. Thus you could say any of the following:
A ⊓ E ⊑ ⊥
A ⊓ E ≡ ⊥
A ⊓ E ⊑ ¬⊤
A ⊓ E ≡ ¬⊤
To add what Joshua said, disjointedness representation depends upon the language you use. Example: EL doesnt support bottom and negation.
The axioms you have written is not cyclic.
Cycle: antecedent and consequent of an axiom should have at least one common predicate (Concept or role).
If an axiom contains a cycle, you have to adopt fixpoint semantics to make it unequivocal.
To the best of my knowledge, axioms are meant to get induced knowledge. Converting a cyclic axiom to an acylic axiom: It is difficult to produce similar semantics.
How to convert the following TBox axioms into an acyclic Tbox:
A \sqsubseteq \lnot E
\exists R.A \sqcap \lnot B \sqsubseteq C
C \sqsubseteq B \sqcup A
C = A \sqcup D
A \sqcap \exists R.E \sqsubseteq D