Description logics are knowledge representation and reasoning formalisms which represent conceptual knowledge on an abstract logical level. Concrete domains are a theoretically well-founded approach to the integration of description logic reasoning with reasoning about concrete objects such as numbers, time intervals or spatial regions. In this paper, the complexity of combined reasoning with description logcis and on concrete domains is investigated. We extend ALC(D), which is the basic description logic for reasoning with concrete domains, by the operators 'feature agreement' and 'feature disagreement'. For the extended logic,called ALCF(D), an algorithm for deciding the ABox consistency problem is devised. The strategy employed by this algorithm is vital for the efficient implementation of reasoners for description logics incorporating concrete domains. Based on the algorithm, it is proved that the standard reasoning problems for both logics ALC(D) and ALCF(D) are PSpace-complete - provided that the satisfiability test of the concrete domain used is in PSpace. / This is an extended version of the article in: Proceedings of IJCAI-99, Stockholm, Sweden, July 31-August 6, Morgan Kaufmann Publ. In ., San Mateo, CA, 1999
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:78883 |
| Date | 20 May 2022 |
| Creators | Lutz, Carsten |
| Publisher | Aachen University of Technology |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/acceptedVersion, doc-type:report, info:eu-repo/semantics/report, doc-type:Text |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | urn:nbn:de:bsz:14-qucosa2-785040, qucosa:78504 |
Page generated in 0.0041 seconds