Recently there was some attention on integration of description logics of the AL-family with rule-based languages for querying relational databases such as datalog,so as to achieve the best characteristics of both kinds of formalisms in a common framework.Formal analysis on such hybrid languages has been limited to computational complexity: i.e.,how much time/space it is needed to answer to a specific query?
展开▼
