We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min,max,count,sum), which are usually available in database systems. We present decision procedures for the inference problems satisfiability for these Logics-provided that the concrete domain is
not too expressive. An example of such a concrete domain is the set of (nonnegative) integers with comparisons (=,≤, ≤n, ...) and the aggregation functions min, max, count. / This is a new, extended version of a report with the same number.
An abridged version has appeared in the Proceedings of the European Conference on Artificial Intelligence, Brighton, UK, 1998.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:78821 |
| Date | 19 May 2022 |
| Creators | Baader, Franz, Sattler, Ulrike |
| 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.0022 seconds