Unification of concept terms is a new kind of inference problem for Description Logics, which extends the equivalence problem by allowing to replace certain concept names by concept terms before testing for equivalence. We show that this inference problem is of interest for applications, and present first decidability and complexity results for a small concept description language. / This revised version of LTCS-Report 97-02 provides a stronger complexity result in Section 6. An abridged version will appear in Proc. ECAI'98 .
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:78827 |
| Date | 19 May 2022 |
| Creators | Baader, Franz, Narendran, Paliath |
| 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.0073 seconds