On the relative succinctness of two extensions by definitions of multimodal logic

Authors:
Wiebe van der Hoek;Petar Iliev;Barteld Kooi
Affiliations:
Department of Computer Science, University of Liverpool, Liverpool, United Kingdom;Department of Computer Science, University of Liverpool, Liverpool, United Kingdom;Department of Theoretical Philosophy, University of Groningen, Groningen, GL, The Netherlands
Venue:
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Year:
2012

Citing 6
Cited 1

Modal logic

Modal logic
An n! lower bound on formula size

ACM Transactions on Computational Logic (TOCL)
The Succinctness of First-Order Logic on Linear Orders

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Complexity and succinctness of public announcement logic

AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
The comparative linguistics of knowledge representation

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Succinctness of epistemic languages

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two

On the succinctness of some modal logics

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The growing number of logics has lead to the question: How do we compare two formalisms? A natural answer is: We can compare their expressive power and computational properties. There is, however, another way of comparing logics that has attracted attention recently, namely in terms of representational succinctness, i.e., we can ask whether one of the logics allows for a more "economical" encoding of information than the other. Using extended-syntax trees that correspond to game trees for the Addler-Immerman games, we prove that two well-known abbreviations in multimodal logic lead to an exponential increase in succinctness.