A proof system for time-dependent multi-agents

Authors:
Norihiro Kamide
Affiliations:
Waseda Institute for Advanced Study, Waseda University, Tokyo, Japan
Venue:
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part I
Year:
2010

Citing 7
Cited 1

Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Reasoning about knowledge

Reasoning about knowledge
Model Checking Knowledge and Time in Systems with Perfect Recall (Extended Abstract)

Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
VerICS 2007 - a Model Checker for Knowledge and Real-Time

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Embedding Linear-Time Temporal Logic into Infinitary Logic: Application to Cut-Elimination for Multi-agent Infinitary Epistemic Linear-Time Temporal Logic

Computational Logic in Multi-Agent Systems
MCMAS: a model checker for multi-agent systems

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Reasoning about time-dependent multi-agents: foundations of theorem proving and model checking

Transactions on Compuational Collective Intelligence VI

Quantified Score

Hi-index	0.00

Visualization

Abstract

An extension of linear-time temporal logic (LTL), called an agents-indexed linear-time temporal logic (ALTL), is introduced as a Gentzen-type sequent calculus. ALTL is intended to appropriately express reasoning about time-dependent multi-agents within a proof system. The cut-elimination and completeness theorems for ALTL are shown.