From Conjunctive Queries to Instance Queries in Ontology-Mediated Querying

Authors: Cristina Feier, Carsten Lutz, Frank Wolter

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

Reproducibility Variable Result LLM Response
Research Type Theoretical We provide precise characterizations, tight complexity bounds for deciding whether a given OMQ is rewritable, and show how to construct the rewritten query when it exists. In fact, we prove that the classes of CQs from [Kikot and Zolin, 2013] are depleting, but we go significantly beyond that
Researcher Affiliation Academia 1 University of Bremen, Germany 2 University of Liverpool, UK
Pseudocode No The paper contains mathematical definitions, theorems, and proofs, but no pseudocode or clearly labeled algorithm blocks.
Open Source Code No The paper does not provide an explicit statement about the release of source code for the described methodology or a link to a code repository.
Open Datasets No The paper is theoretical and focuses on characterizations and complexity bounds. It does not describe experiments involving datasets for training or evaluation.
Dataset Splits No The paper is theoretical and does not discuss dataset splits for training, validation, or testing.
Hardware Specification No The paper is theoretical and does not describe any specific hardware used for conducting experiments.
Software Dependencies No The paper is theoretical and does not list any specific software dependencies with version numbers for experimental replication.
Experiment Setup No The paper is theoretical and does not describe any experimental setup details such as hyperparameters or training settings.