A One-Pass Tree-Shaped Tableau for Defeasible LTL - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

A One-Pass Tree-Shaped Tableau for Defeasible LTL

Résumé

Defeasible Linear Temporal Logic is a defeasible temporal formalism for representing and verifying exception-tolerant systems. It is based on Linear Temporal Logic (LTL) and builds on the preferential approach of Kraus et al. for non-monotonic reasoning, which allows us to formalize and reason with exceptions. In this paper, we tackle the satisfiability checking problem for defeasible LTL. One of the methods for satisfiability checking in LTL is the one-pass tree shaped analytic tableau proposed by Reynolds. We adapt his tableau to defeasible LTL by integrating the preferential semantics to the method. The novelty of this work is in showing how the preferential semantics works in a tableau method for defeasible linear temporal logic. We introduce a sound and complete tableau method for a fragment that can serve as the basis for further exploring tableau methods for this logic.
Fichier principal
Vignette du fichier
time2021_Definitive_version.pdf (720.49 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03699248 , version 1 (04-04-2024)

Identifiants

Citer

Anasse Chafik, Fahima Cheikh-Alili, Jean-François Condotta, Ivan Varzinczak. A One-Pass Tree-Shaped Tableau for Defeasible LTL. 28th International Symposium on Temporal Representation and Reasoning (TIME 2021), Alpen-Adria-Universität Klagenfurt, Sep 2021, Klagenfurt, Austria. pp.16:1-16:18, ⟨10.4230/LIPIcs.TIME.2021.16⟩. ⟨hal-03699248⟩
14 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More