arXiv AI By St\'ephane Demri, Tianwen Gu

Robustness of Constraint Automata for Description Logics with Concrete Domains

Read the original on arXiv AI →

arXiv: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 tableaux-based or type elimination methods.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv AI.