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
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. 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:2607. 22636v1 Announce Type: new Abstract: Ontology-mediated query answering is concerned with the problem of answering queries over knowledge bases consisting of a database instance and an ontology.
By Jean-Fran\c{c}ois Baget (LIRMM, Inria, University of Montpellier, CNRS, France), Meghyn Bienvenu (Univ. Bordeaux, CNRS, Bordeaux INP, LaBRI, France), Marie-Laure Mugnier (LIRMM, Inria, University of Montpellier, CNRS, France), Micha\"el Thomazo (Inria, DIENS, ENS, PSL University, CNRS, France)
arXiv:2606. 24618v1 Announce Type: new Abstract: In ontology-based data access (OBDA), multiple data sources are integrated via mappings to an ontology.
By Michel Lecl\`ere, Marie-Laure Mugnier, Guillaume P\'erution-Kihli
The paper introduces the Evidential-Based Higher-Order Set Argumentation Framework (EHSAF), a unified formalism that extends Dung’s abstract argumentation by incorporating evidential support, higher-order relations, and collective interactions. Two complete semantics are defined: an adjacent complete labelling semantics allowing multiple truth values for arguments in support cycles, and an extension-based complete semantics that accepts only well‑founded support chains. The authors provide a propositional encoding in three‑valued Łukasiewicz logic and extend it to continuous fuzzy logics, proving key properties and showing equivalence under support‑acyclicity.
By Shuai Tang