A proof system for temporal reasoning with sequential information

Authors:
Norihiro Kamide
Affiliations:
Waseda Institute for Advanced Study, Waseda University, Tokyo, Japan
Venue:
SBIA'10 Proceedings of the 20th Brazilian conference on Advances in artificial intelligence
Year:
2010

Citing 5
Cited 1

The complexity of propositional linear temporal logics

Journal of the ACM (JACM)
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Logic of Information Structures

Logic of Information Structures
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Extended Full Computation-Tree Logic with Sequence Modal Operator: Representing Hierarchical Tree Structures

AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence

Reasoning about Resources and Information: A Linear Logic Approach

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new logic, sequence-indexed linear-time temporal logic (SLTL), is obtained semantically from the standard linear-time temporal logic LTL by adding a sequence modal operator which represents a sequence of symbols. By the sequence modal operator of SLTL, we can appropriately express "sequential information" in temporal reasoning. A Gentzen-type sequent calculus for SLTL is introduced, and the completeness and cut-elimination theorems for this calculus are proved. SLTL is also shown to be PSPACE-complete and embeddable into LTL.