Description Logic Rule
(Redirected from DL Rule)
Jump to navigation
Jump to search
See: Description Logics Statement, Production Rule, DL-Safe Rule.
References
2008
- (Krötzsch et al., 2008) ⇒ Markus Krötzsch, Sebastian Rudolph and Pascal Hitzler. (2008). “Description Logic Rules.” In: Proceedings of the 18th European Conference on Artificial Intelligence (ECAI 2008).
- QUOTE: Given sets B and H of atoms, and a set [math]\displaystyle{ x \subseteq V }[/math] of all variables in [math]\displaystyle{ B \cup H }[/math], a description logic rule (DL rule) is a formula [math]\displaystyle{ \forall x. \land B \rightarrow \land H }[/math] such that:
(R1) for any [math]\displaystyle{ u \in N_I \cup V }[/math] that is not initial in B, there is a path from exactly one initial [math]\displaystyle{ t \in N_I \cup V }[/math] to u in B,
(R2) for any [math]\displaystyle{ t, u \in N_I \cup V }[/math], there is at most one path in B from t to u,
(R3) if H contains an atom C(t) or R(t, u), then t is initial in B.
- QUOTE: Given sets B and H of atoms, and a set [math]\displaystyle{ x \subseteq V }[/math] of all variables in [math]\displaystyle{ B \cup H }[/math], a description logic rule (DL rule) is a formula [math]\displaystyle{ \forall x. \land B \rightarrow \land H }[/math] such that: