knowledge base
Table of Contents
knowledge base in description logic referes to \(K = (T,A)\) where:
- \(T\) is a Taxonomy, represented with TBox, which is a set of subsumption
- \(A\) is a set of assertion (ABox).
Backlinks
tableaux method is a way of determining consistency in acylic knowledge base.
query knowledge base
There’s 3 types of query knowledge base \(K\):
- whether \(X\) is coherent with respect to \(K\) <-> whether $K’ = (A ∪{o:X},T) $ is consistent (\(o\) does not occur in \(K\))
- whether \(K \models o:X\) <-> whether \(K' = (A\cup{o:\neg X},T)\) is
inconsistent - whether \(K \models X \sqsubseteq Y\) whether \(K' = (A\cup{o:X,o:\neg Y},T)\) is not consistent
The query could be done with