On the decidability of a fragment of preferential LTL
From MaRDI portal
Publication:6060107
DOI10.4230/LIPICS.TIME.2020.19zbMATH Open1530.03050MaRDI QIDQ6060107FDOQ6060107
Authors: Jean-François Condotta, Ivan Varzinczak 
Publication date: 2 November 2023
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
Knowledge representation (68T30) Logic in artificial intelligence (68T27) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)
Cites Work
- Nonmonotonic reasoning, preferential models and cumulative logics
- The complexity of propositional linear temporal logics
- Temporal logic can be more expressive
- Tableau methods for modal and temporal logics
- Preferential reasoning for modal logics
- Title not available (Why is that?)
- From knowledge-based programs to graded belief-based programs. I: On-line reasoning
- Analytic tableaux calculi for KLM logics of nonmonotonic reasoning
- General patterns for nonmonotonic reasoning: from basic entailments to plausible relations
- Preferential Description Logics
- From KLM-style conditionals to defeasible modalities, and back
- Mathematical Logic for Computer Science
- Preferential tableaux for contextual defeasible \(\mathcal{ALC}\)
Cited In (1)
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)
