Temporal Logics Over Finite Traces with Uncertainty

Authors: Fabrizio M Maggi, Marco Montali, Rafael Peñaloza10218-10225

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

Reproducibility Variable Result LLM Response
Research Type Theoretical We thus propose a new probabilistic temporal logic over finite traces using superposition semantics, where all possible evolutions are possible, until observed. We study the properties of the logic and provide automata-based mechanisms for deriving probabilistic inferences from its formulas. We then study a fragment of the logic with better computational properties.
Researcher Affiliation Academia Fabrizio M. Maggi University of Tartu f.m.maggi@ut.ee; Marco Montali Free University of Bozen-Bolzano montali@inf.unibz.it; Rafael Pe naloza University of Milano-Bicocca rafael.penaloza@unimib.it
Pseudocode Yes Algorithm 1: Most likely scenario for t over Φ.
Open Source Code No The paper does not provide an explicit statement or link for open-sourcing its code for the described methodology. It mentions
Open Datasets No The paper is theoretical and does not conduct empirical studies with specific datasets. While it discusses "event log data" in the context of potential applications, it does not provide access information for a dataset used in experiments within this paper.
Dataset Splits No The paper is theoretical and does not describe empirical experiments with dataset splits for training, validation, or testing.
Hardware Specification No The paper is theoretical and does not describe experiments that would require specific hardware. No hardware specifications are provided.
Software Dependencies No The paper is theoretical, focusing on logical frameworks and automata. It does not describe any specific software implementations or dependencies with version numbers that would be required to reproduce experiments.
Experiment Setup No The paper is theoretical and does not describe an experimental setup with specific hyperparameters or training configurations.