A One-Pass Tree-Shaped Tableau for Defeasible LTL

DOI10.4230/LIPICS.TIME.2021.16MaRDI QIDQ6080283zbMATH OpenOpenAlexFDO

Authors Jean-François Condotta, Ivan Varzinczak

Publication date 2 October 2023

Full work available at URL https://hal.science/hal-03699248

zbMATH Keywords

non-monotonic reasoningtableau calculitemporal logic

Mathematics Subject Classification ID

Temporal logic (03B44) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in artificial intelligence (68T27)

Recommendations

• A one-pass tree-shaped tableau for LTL+past
• One-pass and tree-shaped tableau systems for TPTL and \(\mathrm{TPTL_b+Past}\)
• A new rule for LTL tableaux
• On the decidability of a fragment of preferential LTL
• One-pass and tree-shaped tableau systems for \(\mathrm{TPTL}\) and \(\mathrm{TPTL}_b+\mathrm{Past}\)

Cited in

(2)

• On the decidability of a fragment of preferential LTL
• Defeasible linear temporal logic

This page was built for publication: A One-Pass Tree-Shaped Tableau for Defeasible LTL

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