Robustness of Constraint Automata for Description Logics with Concrete Domains
DGX agentarXiv:2601.19644v2 Announce Type: replace-cross Abstract: Decidability or complexity issues about the consistency problem for description logics with concrete domains have already been analysed with t