The Complexity of Clausal Fragments of LTL

DOI10.1007/978-3-642-45221-5_3zbMath1433.03046arXiv1306.5088OpenAlexW1581108661WikidataQ62048620 ScholiaQ62048620MaRDI QIDQ2870113

Vladislav Ryzhikov, Alessandro Artale, Roman Kontchakov, Michael Zakharyashchev

Publication date: 17 January 2014

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.5088

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)

Related Items (10)

Logic of temporal attribute implications ⋮ Sub-propositional Fragments of the Interval Temporal Logic of Allen’s Relations ⋮ Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic ⋮ Unnamed Item ⋮ Backdoors for linear temporal logic ⋮ First-order rewritability of ontology-mediated queries in linear temporal logic ⋮ Unnamed Item ⋮ An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning ⋮ An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning ⋮ First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries

This page was built for publication: The Complexity of Clausal Fragments of LTL