Answering Counting Queries over DL-Lite Ontologies

Authors: Meghyn Bienvenu, Quentin Manière, Michaël Thomazo

IJCAI 2020 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical In this paper, we introduce a general form of counting query, relate it to previous proposals, and study the complexity of answering such queries in the presence of DL-Lite ontologies. As it follows from existing work that query answering is intractable and often of high complexity, we consider some practically relevant restrictions, for which we establish improved complexity bounds.
Researcher Affiliation Academia Meghyn Bienvenu1 , Quentin Mani ere1 and Micha el Thomazo2 1University of Bordeaux, CNRS, Bordeaux INP, La BRI, Talence, France 2Inria, DI ENS, ENS, CNRS, University PSL, Paris, France
Pseudocode No The paper presents theoretical proofs and complexity analysis, but it does not include any pseudocode or clearly labeled algorithm blocks.
Open Source Code No The paper does not provide any statement about making its source code available or include links to code repositories. It mentions: "An appendix with full proofs can be found in the long version of this paper, available on arXiv."
Open Datasets No The paper is a theoretical work on query answering complexity and does not involve experimental training on datasets. Therefore, no information about publicly available training data is provided.
Dataset Splits No The paper is theoretical and does not involve experiments with dataset splits. Thus, no validation split information is provided.
Hardware Specification No The paper is theoretical, dealing with logical foundations and complexity analysis, and does not describe any computational experiments. Therefore, no hardware specifications are mentioned.
Software Dependencies No The paper is a theoretical work focusing on logical formalisms and complexity. It does not describe software implementations or specific software dependencies with version numbers for experimental reproducibility.
Experiment Setup No The paper is theoretical and does not involve experimental setups, hyperparameters, or training configurations. Therefore, no such details are provided.