A One-Pass Tree-Shaped Tableau for LTL+Past

Nicola Gigante, Angelo Montanari, Mark Reynolds

Research output: Chapter in Book/Conference paperConference paper

Abstract

Linear Temporal Logic (LTL) is a de-facto standard formalism for expressing properties of systems and temporal constraints in formal verification, artificial intelligence, and other areas of computer science. The problem of LTL satisfiability is thus prominently important to check the consistency of these temporal specifications. Although adding past operators to LTL does not increase its expressive power, recently the interest for explicitly handling the past in temporal logics has increased because of the clarity and succinctness that those operators provide. In this work, a recently proposed one-pass tree-shaped tableau system for LTL is extended to support past operators. The modularity of the required changes provides evidence for the claimed ease of extensibility of this tableau system.
Original languageEnglish
Title of host publicationLPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning
EditorsThomas Eiter, David Sands
Place of PublicationUnited Kingdom
PublisherEasyChair
Pages456-473
Number of pages17
Volume46
DOIs
Publication statusPublished - 2017
Event21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning 2017 - Maun, Botswana
Duration: 7 May 201712 May 2017

Publication series

Name EPiC Series in Computing
ISSN (Electronic)2398-7340

Conference

Conference21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning 2017
Abbreviated titleLPAR21
CountryBotswana
CityMaun
Period7/05/1712/05/17

Fingerprint Dive into the research topics of 'A One-Pass Tree-Shaped Tableau for LTL+Past'. Together they form a unique fingerprint.

Cite this