Description Logics with Aggregates and Concrete Domains
From International Center for Computational Logic
Description Logics with Aggregates and Concrete Domains
Franz BaaderFranz Baader, Ulrike SattlerUlrike Sattler
Franz Baader, Ulrike Sattler
Description Logics with Aggregates and Concrete Domains
Information Systems, 28(8):979-1004, 2003
Description Logics with Aggregates and Concrete Domains
Information Systems, 28(8):979-1004, 2003
- KurzfassungAbstract
Description Logics are a family of knowledge representation formalisms well-suited for intensional reasoning about conceptual models of databases/data warehouses. We extend Description Logics with concrete domains (such as integers and rational numbers) that include aggregation functions over these domains (such as min, max, count, and sum) which are usually available in database systems. We show that the presence of aggregation functions may easily lead to undecidability of (intensional) inference problems such as satisfiability and subsumption. However, there are also extensions for which satisfiability and subsumption are decidable, and we present decision procedures for the relevant inference problems. - Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@article{ BaaderSattlerIS-02,
author = {F. {Baader} and U. {Sattler}},
journal = {Information Systems},
number = {8},
pages = {979--1004},
title = {Description Logics with Aggregates and Concrete Domains},
volume = {28},
year = {2003},
}
