Querying any information system requires the knowledge of some formal language, making it inaccessible to computer-na?ve potential users. We propose a new intuitive querying mecha...
Knowledge representations using semantic web technologies often provide information which translates to explicit term and predicate taxonomies in relational learning. We show how t...
Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, this reasoning service ca...
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
This paper concerns the task of removing redundant information from a given knowledge base, and restructuring it in the form of a tree, so as to admit efficient problem solving ro...