Do You Need Infinite Time?
Authors: Alessandro Artale, Andrea Mazzullo, Ana Ozaki
IJCAI 2019 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | In this paper, we investigate first-order temporal logic over finite traces, lifting some known results to a more expressive setting. Satisfiability in the two-variable monodic fragment is shown to be EXPSPACE-complete, as for the infinite trace case, while it decreases to NEXPTIME when we consider finite traces bounded in the number of instants. This leads to new complexity results for temporal description logics over finite traces. |
| Researcher Affiliation | Academia | Alessandro Artale , Andrea Mazzullo and Ana Ozaki KRDB Research Centre Free University of Bozen Bolzano {artale, mazzullo, ozaki}@inf.unibz.it |
| Pseudocode | No | No sections or figures explicitly labeled 'Pseudocode' or 'Algorithm' found, nor any code-like formatted procedures. |
| Open Source Code | No | No explicit statement about releasing source code or a direct link to a code repository for the described methodology was found. |
| Open Datasets | No | This is a theoretical paper and does not use datasets or conduct experiments requiring training data. |
| Dataset Splits | No | This is a theoretical paper and does not involve data splits (train/validation/test). |
| Hardware Specification | No | This is a theoretical paper and does not describe experimental hardware. |
| Software Dependencies | No | This is a theoretical paper and does not list software dependencies with version numbers for experimental reproducibility. |
| Experiment Setup | No | This is a theoretical paper and does not describe an experimental setup or hyperparameters. |