The Complexity of Model Checking Knowledge and Time

Authors: Laura Bozzelli, Bastien Maubert, Aniello Murano

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

Reproducibility Variable Result LLM Response
Research Type Theoretical We establish the precise complexity of the model checking problem for the main logics of knowledge and time." and "We close it by establishing improved upper bounds for CTL* with knowledge, and providing matching lower bounds that also apply for epistemic extensions of LTL and CTL.
Researcher Affiliation Academia Laura Bozzelli , Bastien Maubert and Aniello Murano Universit a degli Studi di Napoli Federico II , Italy
Pseudocode No The paper describes algorithmic steps and constructions (e.g., 'powerset construction'), but it does not include a clearly labeled 'Pseudocode' or 'Algorithm' block, nor structured steps formatted like code.
Open Source Code No The paper does not mention or provide any open-source code for the methodology it describes.
Open Datasets No This paper is theoretical, dealing with complexity theory and logic. It does not conduct experiments on datasets or provide any information about dataset availability or access.
Dataset Splits No The paper is theoretical and focuses on complexity proofs and logical constructions. It does not mention or provide any information about training, validation, or test dataset splits.
Hardware Specification No The paper is theoretical, focusing on complexity theory and logical proofs. It does not describe any computational experiments or specify hardware used.
Software Dependencies No The paper is theoretical and does not describe software implementations or experiments that would require specific software dependencies with version numbers.
Experiment Setup No The paper is theoretical and focuses on mathematical proofs and logical analysis. It does not contain details about experimental setup, hyperparameters, or system-level training settings.