DL-Safe Rule
Jump to navigation
Jump to search
See: DL Rule, Non-DL-Atom, Rule Body, Safe Rule, Conjunctive DL-Safe Rule, Positive DL-Safe Rule, Decidable System.
References
2004
- (Motik et al., 2004) ⇒ Boris Motik, Ulrike Sattler and Rudi Studer. (2004). “Query Answering for OWL-DL with Rules.” In: Proceedings of the Third International Semantic Web Conference (ISWC 2004). doi:10.1007/978-3-540-30475-3_38
- QUOTE: Let KB be a SHOIN(D) knowledge base, and let NP be a set of predicate symbols such that NC ∪ NRa ∪ NRc ⊆ NP . A DL-atom is an atom of the form A(s), where A ∈ NC, or of the form R(s, t), where R ∈ NRa ∪ NRc . A rule r is called DL-safe if each variable in r occurs in a non-DL-atom in the rule body. A program P is DL-safe if all its rules are DL-safe.