arXiv:2607. 21191v1 Announce Type: cross Abstract: Event-B is a formal method rooted in predicate logic and set theory.
By Katharina Engels (Heinrich Heine University D\"usseldorf), Jan Gruteser (Heinrich Heine University D\"usseldorf), Michael Leuschel (Heinrich Heine University D\"usseldorf)
Description logic programs are a powerful formalism for combining rules with ontologies. The well-supported semantics for description logic programs ensures that no answer sets rely on cyclic dependencies.
arXiv:2607. 21203v1 Announce Type: new Abstract: Description logic programs are a powerful formalism for combining rules with ontologies.
By Spencer Killen, Jia-Huai You
arXiv:2607. 16715v1 Announce Type: new Abstract: We study Controlled Query Evaluation (CQE), a declarative approach to confidentiality-preserving data access, in the context of Description Logic (DL) ontologies, and for confidentiality policies expressed through Epistemic Dependencies (EDs).
By Lorenzo Marconi, Daniela Rieti, Riccardo ROsati
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.
By St\'ephane Demri, Tianwen Gu
arXiv:2608. 14104v1 Announce Type: cross Abstract: The Shapes Constraint Language (SHACL) is a W3C recommendation to express syntactic constraints, called shapes, on RDF graphs.
By Anouk Oudshoorn, Piotr Gorczyca, D\"orthe Arndt