Enrico Franconi,

Abstract

The first Methods for Modalities workshop (M4M-1) was born late at night in November 1998, with a knock on a door, a small but adequate budget, and the urge to do new things. It grew from the good disposition of invited speakers, the enthusiasm of contributors, and long hours behind the computer answering mails, printing articles, organizing time tables, designing web pages and answering phone calls. The aim was clear: to bring together some of the people, logicians and/or computer scientists who were, in one way or another, computing with modal and modal-like logics such as description logic, hybrid logic, temporal logic, etc. The connections between logic and computing are wide-spread and varied. Wellknown examples of uses of logic in computer science include automated verification [25], databases [2], knowledge representation [8], artificial intelligence [20], formal languages [28], etc. Going in the opposite direction, from computer science to logic, we find extremely fast implementations of model checkers and tableaux-based and resolution-based theorem provers [9], automata-theoretic methods for deciding powerful languages [5], tight connections between the theories of computational and descriptive complexity [24], etc. And this is just a small part of a far bigger development, as logic continues to play an important role in computer science and permeating more and more of its main areas. All signs indicate that computer science and logic have decided to establish a stronghold together and profit from the interchange of ideas. This development has been recognized throughout the community, as is witnessed, for instance, by this year’s launch of the ACM Transactions on Computational Logic [30], the founding of IFCOLOG, the International Federation on Computational Logic [23], and the first installment of the International Conference on Computational Logic [12]. While the links between computer science and modal logic may be viewed as nothing more than specific instances of these developments, there is something special to them. Graphs are the key. Graphs are ubiquitous in computer science: think of transition systems, parse trees, Petri nets, decision diagrams, flow charts, . . . It is because of this, that modal languages are so well suited to describe com-

Cite this paper

@inproceedings{RijkeEnricoF, title={Enrico Franconi,}, author={Maarten de Rijke} }