Skip to Main content Skip to Navigation
New interface
Conference papers

On the Decidability of a Fragment of preferential LTL

Abstract : Linear Temporal Logic (LTL) has found extensive applications in Computer Science and Artificial Intelligence, notably as a formal framework for representing and verifying computer systems that vary over time. Non-monotonic reasoning, on the other hand, allows us to formalize and reason with exceptions and the dynamics of information. The goal of this paper is therefore to enrich temporal formalisms with non-monotonic reasoning features. We do so by investigating a preferential semantics for defeasible LTL along the lines of that extensively studied by Kraus et al. in the propositional case and recently extended to modal and description logics. The main contribution of the paper is a decidability result for a meaningful fragment of preferential LTL that can serve as the basis for further exploration of defeasibility in temporal formalisms.
Document type :
Conference papers
Complete list of metadata
Contributor : Fabien DELORME Connect in order to contact the contributor
Submitted on : Tuesday, July 27, 2021 - 9:16:53 AM
Last modification on : Sunday, June 26, 2022 - 3:11:36 AM


  • HAL Id : hal-03300290, version 1



Ivan Varzinczak, Fahima Cheikh, Jean-François Condotta, Anasse Chafik. On the Decidability of a Fragment of preferential LTL. International Symposium on Temporal Representation and Reasoning (TIME), 2019, Malaga, Spain. pp.19:1--19:19. ⟨hal-03300290⟩



Record views