%0 Journal Article %1 Baader2024 %A Baader, Franz %A De Bortoli, Filippo %C New York, NY, USA %D 2024 %I Association for Computing Machinery %J SIGAPP Appl. Comput. Rev. %K topic_knowledge imported %N 3 %P 5–17 %R 10.1145/3699839.3699840 %T Logics with Concrete Domains: First-Order Properties, Abstract Expressive Power, and (Un)Decidability %U https://doi.org/10.1145/3699839.3699840 %V 24 %X Concrete domains have been introduced in description logic (DL) to enable reference to concrete objects (such as numbers) and predefined predicates on these objects (such as numerical comparisons) when defining concepts. The primary research goal in this context was to find restrictions on the concrete domain such that its integration into certain DLs preserves decidability or tractability. In this article, we complement these investigations by studying the abstract expressive power of both first-order and description logics extended with concrete domains, i.e., we analyze which classes of first-order interpretations can be expressed using these logics, compared to what their counterparts without concrete domains can express. We demonstrate that, under natural conditions on the concrete domain D (which also play a role for decidability), extensions of first-order logic (FOL) or the well-known DL ALC with D share important formal characteristics with FOL, such as the compactness and the Löwenheim-Skolem properties. Nevertheless, these conditions do not ensure that the abstract expressive power of the extensions we consider is contained in that of FOL, though in some cases it is. To be more precise, we show, on the one hand, that unary concrete domains leave the abstract expressive power within FOL if we are allowed to introduce auxiliary predicates. As a by-product, we obtain (semi-)decidability results for some fragments of FOL extended with the concrete domains considered in this article. On the other hand, we show that the ability to express equality between elements of D, another condition employed in the context of showing decidability of ALC(D), is sufficient to push the abstract expressive power of most first-order fragments with concrete domains beyond that of FOL. While for such concrete domains D decidability is retained for ALC(D), we show that the availability of equality in D causes undecidability of the two-variable fragment of FOL(D), although the two-variable fragment of FOL is decidable.

@article{Baader2024, abstract = {Concrete domains have been introduced in description logic (DL) to enable reference to concrete objects (such as numbers) and predefined predicates on these objects (such as numerical comparisons) when defining concepts. The primary research goal in this context was to find restrictions on the concrete domain such that its integration into certain DLs preserves decidability or tractability. In this article, we complement these investigations by studying the abstract expressive power of both first-order and description logics extended with concrete domains, i.e., we analyze which classes of first-order interpretations can be expressed using these logics, compared to what their counterparts without concrete domains can express. We demonstrate that, under natural conditions on the concrete domain D (which also play a role for decidability), extensions of first-order logic (FOL) or the well-known DL ALC with D share important formal characteristics with FOL, such as the compactness and the Löwenheim-Skolem properties. Nevertheless, these conditions do not ensure that the abstract expressive power of the extensions we consider is contained in that of FOL, though in some cases it is. To be more precise, we show, on the one hand, that unary concrete domains leave the abstract expressive power within FOL if we are allowed to introduce auxiliary predicates. As a by-product, we obtain (semi-)decidability results for some fragments of FOL extended with the concrete domains considered in this article. On the other hand, we show that the ability to express equality between elements of D, another condition employed in the context of showing decidability of ALC(D), is sufficient to push the abstract expressive power of most first-order fragments with concrete domains beyond that of FOL. While for such concrete domains D decidability is retained for ALC(D), we show that the availability of equality in D causes undecidability of the two-variable fragment of FOL(D), although the two-variable fragment of FOL is decidable.}, added-at = {2024-10-17T10:59:44.000+0200}, address = {New York, NY, USA}, author = {Baader, Franz and De Bortoli, Filippo}, biburl = {https://puma.scadsai.uni-leipzig.de/bibtex/2fbffaba8cb2eaa664d819af239b07e1a/scadsfct}, day = 8, doi = {10.1145/3699839.3699840}, interhash = {76f6e05a8996e0e94db79dbe5bbf968a}, intrahash = {fbffaba8cb2eaa664d819af239b07e1a}, issn = {1559-6915}, issue_date = {September 2024}, journal = {SIGAPP Appl. Comput. Rev.}, keywords = {topic_knowledge imported}, month = {10}, number = 3, numpages = {13}, pages = {5–17}, publisher = {Association for Computing Machinery}, timestamp = {2024-11-22T15:46:17.000+0100}, title = {Logics with Concrete Domains: First-Order Properties, Abstract Expressive Power, and (Un)Decidability}, url = {https://doi.org/10.1145/3699839.3699840}, volume = 24, year = 2024 }