Modal logics, originally conceived in philosophy, have recently found many applications in computer science, artificial intelligence, the foundations of mathematics, linguistics and other disciplines. Celebrated for their good computational behaviour, modal logics are used as effective formalisms for talking about time, space, knowledge, beliefs, actions, obligations, provability, etc. However, the nice computational properties can drastically change if we combine some of these formalisms into a many-dimensional system, say, to reason about knowledge bases developing in time or moving objects.To study the computational behaviour of many-dimensional modal logics is the main aim of this book. On the one hand, it is concerned with providing a solid mathematical foundation for this discipline, while on the other hand, it shows that many seemingly different applied many-dimensional systems (e.g., multi-agent systems, description logics with epistemic, temporal and dynamic operators, spatio-temporal logics, etc.) fit in perfectly with this theoretical framework, and so their computational behaviour can be analyzed using the developed machinery.We start with concrete examples of applied one- and many-dimensional modal logics such as temporal, epistemic, dynamic, description, spatial logics, and various combinations of these. Then we develop a mathematical theory for handling a spectrum of 'abstract' combinations of modal logics - fusions and products of modal logics, fragments of first-order modal and temporal logics - focusing on three major problems: decidability, axiomatizability, and computational complexity. Besides the standard methods of modal logic, the technical toolkit includes the method of quasimodels, mosaics, tilings, reductions to monadic second-order logic, algebraic logic techniques. Finally, we apply the developed machinery and obtained results to three case studies from the field of knowledge representation and reasoning: temporal epistemic logics for reasoning about multi-agent systems, modalized description logics for dynamic ontologies, and spatio-temporal logics.The genre of the book can be defined as a research monograph. It brings the reader to the front line of current research in the field by showing both recent achievements and directions of future investigations (in particular, multiple open problems). On the other hand, well-known results from modal and first-order logic are formulated without proofs and supplied with references to accessible sources.The intended audience of this book is logicians as well as those researchers who use logic in computer science and artificial intelligence. More specific application areas are, e.g., knowledge representation and reasoning, in particular, terminological, temporal and spatial reasoning, or reasoning about agents. And we also believe that researchers from certain other disciplines, say, temporal and spatial databases or geographical information systems, will benefit from this book as well.Key Features:• Integrated approach to modern modal and temporal logics and their applications in artificial intelligence and computer science• Written by internationally leading researchers in the field of pure and applied logic• Combines mathematical theory of modal logic and applications in artificial intelligence and computer science• Numerous open problems for further research• Well illustrated with pictures and tables

Modal logics, originally conceived in philosophy, have recently found many applications in computer science, artificial intelligence, the foundations of mathematics, linguistics and other disciplines. Celebrated for their good computational behaviour, modal logics are used as effective formalisms for talking about time, space, knowledge, beliefs, actions, obligations, provability, etc. However, the nice computational properties can drastically change if we combine some of these formalisms into a many-dimensional system, say, to reason about knowledge bases developing in time or moving objects. To study the computational behaviour of many-dimensional modal logics is the main aim of this book. On the one hand, it is concerned with providing a solid mathematical foundation for this discipline, while on the other hand, it shows that many seemingly different applied many-dimensional systems (e.g., multi-agent systems, description logics with epistemic, temporal and dynamic operators, spatio-temporal logics, etc.) fit in perfectly with this theoretical framework, and so their computational behaviour can be analyzed using the developed machinery. We start with concrete examples of applied one- and many-dimensional modal logics such as temporal, epistemic, dynamic, description, spatial logics, and various combinations of these. Then we develop a mathematical theory for handling a spectrum of 'abstract' combinations of modal logics - fusions and products of modal logics, fragments of first-order modal and temporal logics - focusing on three major problems: decidability, axiomatizability, and computational complexity. Besides the standard methods of modal logic, the technical toolkit includes the method of quasimodels, mosaics, tilings, reductions to monadic second-order logic, algebraic logic techniques. Finally, we apply the developed machinery and obtained results to three case studies from the field of knowledge representation and reasoning: temporal epistemic logics for reasoning about multi-agent systems, modalized description logics for dynamic ontologies, and spatio-temporal logics. The genre of the book can be defined as a research monograph. It brings the reader to the front line of current research in the field by showing both recent achievements and directions of future investigations (in particular, multiple open problems). On the other hand, well-known results from modal and first-order logic are formulated without proofs and supplied with references to accessible sources. The intended audience of this book is logicians as well as those researchers who use logic in computer science and artificial intelligence. More specific application areas are, e.g., knowledge representation and reasoning, in particular, terminological, temporal and spatial reasoning, or reasoning about agents. And we also believe that researchers from certain other disciplines, say, temporal and spatial databases or geographical information systems, will benefit from this book as well. Key Features: • Integrated approach to modern modal and temporal logics and their applications in artificial intelligence and computer science • Written by internationally leading researchers in the field of pure and applied logic • Combines mathematical theory of modal logic and applications in artificial intelligence and computer science • Numerous open problems for further research • Well illustrated with pictures and tables

Modal Logic is a branch of logic with applications in many related disciplines such as computer science, philosophy, linguistics and artificial intelligence. Over the last twenty years, in all of these neighbouring fields, modal systems have been developed that we call multi-dimensional. (Our definition of multi-dimensionality in modal logic is a technical one: we call a modal formalism multi-dimensional if, in its intended semantics, the universe of a model consists of states that are tuples over some more basic set.) This book treats such multi-dimensional modal logics in a uniform way, linking their mathematical theory to the research tradition in algebraic logic. We will define and discuss a number of systems in detail, focusing on such aspects as expressiveness, definability, axiomatics, decidability and interpolation. Although the book will be mathematical in spirit, we take care to give motivations from the disciplines mentioned earlier on.

This book is intended to serve as an advanced text and reference work on modal logic, a subject of growing importance which has applications to philosophy and linguistics. Although it is based mainly on research which I carried out during the years 1969-1973, it also includes some related results obtained by other workers in the field (see the refer ences in Part 7). Parts 0, 1 and 2, can be used as the basis of a one year graduate course in modal logic. The material which they contain has been taught in such courses at Stanford since 1970. The remaining parts of the book contain more than enough material for a second course in modal logic. The exercises supplement the text and are usually difficult. I wish to thank Stanford University and Bar-Han University for making it possible for me to continue and finish this work, and A. Ungar for correcting the typescript. Bar-Ilan University, Israel Dov M. GABBA Y PART 0 AN INTRODUCTION TO GENERAL INTENSIONAL LOGICS CHAPTER 0 CONSEQUENCE RELATIONS Motivation We introduce the notions of a consequence relation (which is a generalization of the notion of a logical system) and of a semantics. We show that every consequence relation is complete for a canonical semantics. We define the notion of one semantics being Dian in another and study the basic properties of this notion. The concepts of this chapter are generalizations of the various notions of logical system and possible world semantics found in the literature.

Finite model theory,as understoodhere, is an areaof mathematicallogic that has developed in close connection with applications to computer science, in particular the theory of computational complexity and database theory. One of the fundamental insights of mathematical logic is that our understanding of mathematical phenomena is enriched by elevating the languages we use to describe mathematical structures to objects of explicit study. If mathematics is the science of patterns, then the media through which we discern patterns, as well as the structures in which we discern them, command our attention. It isthis aspect oflogicwhichis mostprominentin model theory,“thebranchof mathematical logic which deals with the relation between a formal language and its interpretations”. No wonder, then, that mathematical logic, and ?nite model theory in particular, should ?nd manifold applications in computer science: from specifying programs to querying databases, computer science is rife with phenomena whose understanding requires close attention to the interaction between language and structure. This volume gives a broadoverviewof some central themes of ?nite model theory: expressive power, descriptive complexity, and zero–one laws, together with selected applications to database theory and arti?cial intelligence, es- cially constraint databases and constraint satisfaction problems. The ?nal chapter provides a concise modern introduction to modal logic,which emp- sizes the continuity in spirit and technique with ?nite model theory.

1. Introduction. 2. The Syntax of Modal Sentential Calculi. 4. Semantics for Logical Necessity. 5. Semantics for S5. 6. Relational World Systems. 7. Quantified Modal Logic. 8. The Semantics of Quantified Modal Logic. 9. Second-Order Modal Logic. 10. Semantics of Second-Order Modal Logic. Afterword. Bibliography. Index.

These are the proceedings of the 11th International Workshop on Compu- tional Logicin Multi-Agent Systems (CLIMA-XI), held during August 16–17,in Lisbon, collocated with the 19th European Conference on Arti?cial Intelligence (ECAI-2010). Multi-agentsystemsarecommunitiesofproblem-solvingentitiesthatcanp- ceive and act upon their environment in order to achieve both their individual goals and their joint goals. The work on such systems integrates many techno- giesandconceptsfromarti?cialintelligenceandotherareasofcomputingaswell as other disciplines. Over recent years, the agent paradigm gained popularity, due to its applicability to a full spectrum of domains, such as search engines, recommendation systems, educational support, e-procurement, simulation and routing,electroniccommerceandtrade,etc.Computationallogicprovidesawe- de?ned, general, and rigorousframeworkfor studying the syntax, semantics and procedures for the various tasks in individual agents, as well as the interaction between, and integration among, agents in multi-agent systems. It also provides tools, techniques and standards for implementations and environments, for li- ing speci?cations to implementations, and for the veri?cation of properties of individual agents, multi-agent systems and their implementations. The purpose of the CLIMA workshops is to provide a forum for discussing techniques, based on computational logic, for representing, programming and reasoning about agents and multi-agent systems in a formal way. Former CLIMA editions have been conducted in conjunction with other - jor Computational Logic and AI events such as CL in 2000, ICLP in 2001 and 2007, FLoC in 2002, LPNMR and AI-Math in 2004, JELIA in 2004 and 2008 and MATES in 2009. In 2005 CLIMA was not associated with any major event.

This book illustrates the program of Logical-Informational Dynamics. Rational agents exploit the information available in the world in delicate ways, adopt a wide range of epistemic attitudes, and in that process, constantly change the world itself. Logical-Informational Dynamics is about logical systems putting such activities at center stage, focusing on the events by which we acquire information and change attitudes. Its contributions show many current logics of information and change at work, often in multi-agent settings where social behavior is essential, and often stressing Johan van Benthem's pioneering work in establishing this program. However, this is not a Festschrift, but a rich tapestry for a field with a wealth of strands of its own. The reader will see the state of the art in such topics as information update, belief change, preference, learning over time, and strategic interaction in games. Moreover, no tight boundary has been enforced, and some chapters add more general mathematical or philosophical foundations or links to current trends in computer science. The theme of this book lies at the interface of many disciplines. Logic is the main methodology, but the various chapters cross easily between mathematics, computer science, philosophy, linguistics, cognitive and social sciences, while also ranging from pure theory to empirical work. Accordingly, the authors of this book represent a wide variety of original thinkers from different research communities. And their interconnected themes challenge at the same time how we think of logic, philosophy and computation. Thus, very much in line with van Benthem's work over many decades, the volume shows how all these disciplines form a natural unity in the perspective of dynamic logicians (broadly conceived) exploring their new themes today. And at the same time, in doing so, it offers a broader conception of logic with a certain grandeur, moving its horizons beyond the traditional study of consequence relations.

Edited in collaboration with FoLLI, the Association of Logic, Language and Information this book constitutes the refereed proceedings of the 27th Workshop on Logic, Language, Information and Communication, WoLLIC 2021, Virtual Event, in October 2021. The 25 full papers presented included 6 invited lectures were fully reviewed and selected from 50 submissions. The idea is to have a forum which is large enough in the number of possible interactions between logic and the sciences related to information and computation.

This book constitutes the refereed proceedings of the 4th International Conference on Algebra and Coalgebra in Computer Science, CALCO 2011, held in Winchester, UK, in August/September 2011. The 21 full papers presented together with 4 invited talks were carefully reviewed and selected from 41 submissions. The papers report results of theoretical work on the mathematics of algebras and coalgebras, the way these results can support methods and techniques for software development, as well as experience with the transfer of the resulting technologies into industrial practice. They cover topics in the fields of abstract models and logics, specialized models and calculi, algebraic and coalgebraic semantics, and system specification and verification. The book also includes 6 papers from the CALCO-tools Workshop, colocated with CALCO 2011 and dedicated to tools based on algebraic and/or coalgebraic principles.