Search results for "Abox"
showing 2 items of 2 documents
The complexity of finite model reasoning in description logics
2005
AbstractWe analyse the complexity of finite model reasoning in the description logic ALCQI, i.e., ALC augmented with qualifying number restrictions, inverse roles, and general TBoxes. It turns out that all relevant reasoning tasks such as concept satisfiability and ABox consistency are ExpTime-complete, regardless of whether the numbers in number restrictions are coded unarily or binarily. Thus, finite model reasoning with ALCQI is not harder than standard reasoning with ALCQI.
Aligning Relational Schema and OWL Ontologies with Hidden Markov Model
2016
The problem of bridging the gap between relational schema and ontologies is actively investigated in the Semantic Web and business communities. The main motivations are the OBDA scenario, where a domain ontology allows to hidden the technical details of the db to end-users; and the persistent storage of ontologies in db for facilitating search and retrieval keeping the benefits of DBMSs such as security and integrity. In these cases, the ABox is usually stored into a db, and the TBox is maintained in an ontology; for this reason, schema alignment is a more significant problem than the instance matching one. The use of manual mappings is hard and expensive, especially for large representatio…