First-Order Rewritability of Temporal Ontology-Mediated Queries

Authors: Alessandro Artale, Roman Kontchakov, Alisa Kovtunova, Vladislav Ryzhikov, Frank Wolter, Michael Zakharyaschev

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

Reproducibility Variable Result LLM Response
Research Type Theoretical The aim of this paper is to launch a systematic investigation of rewritability of TOMQs with arbitrary temporal operators.
Researcher Affiliation Academia 1Faculty of Computer Science Free University of Bozen-Bolzano, Italy 2Department of Computer Science and Information Systems Birkbeck, University of London, UK 3Department of Computer Science University of Liverpool, UK
Pseudocode No The paper does not contain any structured pseudocode or algorithm blocks.
Open Source Code No The paper does not provide any concrete access to source code for the methodology described.
Open Datasets No The paper describes abstract ABoxes for theoretical examples (e.g., 'Ae = {B0(a, n)} {Aei(a, i) | i < n }') but does not provide any concrete access information for a publicly available dataset used for empirical training.
Dataset Splits No The paper does not provide specific dataset split information (e.g., training, validation, test splits), as it is a theoretical paper without empirical experiments.
Hardware Specification No The paper does not provide specific hardware details used for running experiments, as it is a theoretical work.
Software Dependencies No The paper does not provide specific ancillary software details with version numbers, as it describes a theoretical framework and does not detail an implementation.
Experiment Setup No The paper does not contain specific experimental setup details, hyperparameters, or training configurations, as it is a theoretical study.