Querying Attributed DL-Lite Ontologies Using Provenance Semirings

Authors: Camille Bourgaux, Ana Ozaki2719-2726

AAAI 2019 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical In this work, we first investigate the complexity of satisfiability and query answering for attributed DL-Lite R ontologies. We then propose a new semantics, based on provenance semirings, for integrating provenance information with query answering. Finally, we establish complexity results for satisfiability and query answering under this semantics.
Researcher Affiliation Academia Camille Bourgaux T el ecom Paris Tech & DI ENS, CNRS, ENS, PSL University & Inria, France; Ana Ozaki KRDB Research Centre, Free University of Bozen-Bolzano, Italy
Pseudocode No The paper does not contain structured pseudocode or algorithm blocks.
Open Source Code No The paper does not provide any statement or link indicating the availability of open-source code for the methodology described.
Open Datasets No This paper is theoretical and does not involve empirical studies with datasets, therefore no training dataset information is provided.
Dataset Splits No This paper is theoretical and does not involve empirical studies with datasets, therefore no dataset split information is provided.
Hardware Specification No This paper is theoretical and does not describe any experiments that would require hardware specifications.
Software Dependencies No This paper is theoretical and does not describe any software implementations with specific version numbers.
Experiment Setup No This paper is theoretical and does not describe any experimental setup details such as hyperparameters or training configurations.