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

Authors:
Norihiro Kamide
Affiliations:
Waseda Institute for Advanced Study, Waseda University, Tokyo, Japan
Venue:
Transactions on Compuational Collective Intelligence VI
Year:
2012

Citing 15
Cited 0

Temporal and modal logic

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

Reasoning about knowledge
Model checking

Model checking
Introduction to Multiagent Systems

Introduction to Multiagent Systems
Alternating-time temporal logic

Journal of the ACM (JACM)
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
Time, Knowledge, and Cooperation: Alternating-Time Temporal Epistemic Logic and Its Applications

COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
Model checking for multi-valued computation tree logics

Beyond two
Model checking for multivalued logic of knowledge and time

AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
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
A proof system for time-dependent multi-agents

KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part I
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Firstly, 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. Secondly, an extension of computation tree logic (CTL), called an agents-indexed computation tree logic (ACTL), is introduced as a Kripke-type semantics. ACTL is intended to appropriately formalize reasoning about time-dependent multi-agents within an executable temporal logic by model checking. The model-checking, validity and satisfiability problems for ACTL are shown to be decidable.