On the decidability of a fragment of preferential LTL

DOI10.4230/LIPICS.TIME.2020.19MaRDI QIDQ6060107zbMATH OpenFDO

Authors Jean-François Condotta, Ivan Varzinczak

Publication date 2 November 2023

zbMATH Keywords

temporal logicknowledge representationnon-monotonic reasoning

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic in artificial intelligence (68T27) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Recommendations

• A One-Pass Tree-Shaped Tableau for Defeasible LTL
• Temporal and dynamic logic
• Monodic temporal logic with quantified propositional variables
• Decidable and Undecidable Fragments of Halpern and Shoham’s Interval Temporal Logic: Towards a Complete Classification
• scientific article; zbMATH DE number 1536563

Cites work

• scientific article; zbMATH DE number 3930376 (Why is no real title available?)
• Analytic tableaux calculi for KLM logics of nonmonotonic reasoning
• From KLM-style conditionals to defeasible modalities, and back
• From knowledge-based programs to graded belief-based programs. I: On-line reasoning
• General patterns for nonmonotonic reasoning: from basic entailments to plausible relations
• Mathematical Logic for Computer Science
• Nonmonotonic reasoning, preferential models and cumulative logics
• Preferential Description Logics
• Preferential reasoning for modal logics
• Preferential tableaux for contextual defeasible \(\mathcal{ALC}\)
• Tableau methods for modal and temporal logics
• Temporal logic can be more expressive
• The complexity of propositional linear temporal logics

Cited in

(1)

• A One-Pass Tree-Shaped Tableau for Defeasible LTL

This page was built for publication: On the decidability of a fragment of preferential LTL

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6060107)