LTL on finite and process traces: complexity results and a practical reasoner
DOI10.1613/JAIR.1.11256zbMATH Open1451.68176OpenAlexW2902993161WikidataQ128875313 ScholiaQ128875313MaRDI QIDQ4558796FDOQ4558796
Authors: Valeria Fionda, Gianluigi Greco 
Publication date: 30 November 2018
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.1.11256
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Cited In (14)
- On Decidability of LTL+Past Model Checking for Process Rewrite Systems
- On Decidability of LTL Model Checking for Process Rewrite Systems
- On decidability of LTL model checking for process rewrite systems
- SAT meets tableaux for linear temporal logic satisfiability
- LTL goal specifications revisited
- Linear temporal logic -- from infinite to finite horizon
- Reasoning with temporal logic on truncated paths.
- Constructive finite trace analysis with linear temporal logic
- First-order temporal logic on finite traces: semantic properties, decidable fragments, and applications
- An Asymptotically Correct Finite Path Semantics for LTL
- Evaluating compliance: from LTL to abductive logic programming
- \(\mathrm{LTL}_{f}\) satisfiability checking
- SAT-based explicit \(\mathsf{LTL}_f\) satisfiability checking
- Title not available (Why is that?)
This page was built for publication: LTL on finite and process traces: complexity results and a practical reasoner
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558796)
