Dov Gabbay

We develop a logical modelling approach to describe evolvable computational systems. In this account, evolvable systems are built hierarchically from components where each component may have an associated supervisory process. The supervisor's purpose is to monitor and possibly change its associated component. Evolutionary change may be determined purely internally from observations made by the supervisor or may be in response to external change. Supervisory processes may be present at any level in the component hierarchy allowing us to use evolutionary behaviour as an integral part of system design. We model such systems in a revision-based first-order logical framework in which supervisors are modelled as theories which are at a logical meta-level to the theories of their components. This enables evolutionary change of the component to be induced by revision-based changes of the supervisor at the meta-level. In this way, the intervention required in evolutionary change is modelled purely logically. The hierarchical component-based structure is fairly intricate so we present the basic ideas firstly in a simple setting, the well-known blocks world, before introducing tree-based structures to represent component hierarchies. We also introduce some techniques for establishing the behaviour of evolvable systems specified in this logical framework. The ideas and concepts are driven by example throughout. We conclude with a more substantial example, that of a simple model of an evolvable system of automated bank teller machines

This second edition of the Handbook of Philosophical Logic reflects great changes in the landscape of philosophical logic since the first edition. It gives readers an idea of that landscape and its relation to computer science and formal language and artificial intelligence. It shows how the increased demand for philosophical logic from computer science and artificial intelligence and computational linguistics accelerated the development of the subject directly and indirectly. This development in turn, directly pushed research forward, stimulated by the needs of applications. New logic areas becameestablished and old areas were enriched and expanded. At the same time, it socially provided employment for generations of logicians residing in computer science, linguistics and electrical engineering departments which of course helped keep the logic community to thrive. The many contributors to this Handbook are active in these application areas and are among the most famous leading figures of applied philosophical logic of our times.

Agents act on the basis of their beliefs and these beliefs change as they interact with other agents. In this book the authors propose and explain general logical tools for handling change. These tools include preferential reasoning, theory revision, and reasoning in inheritance systems, and the authors use these tools to examine nonmonotonic logic, deontic logic, counterfactuals, modal logic, intuitionistic logic, and temporal logic. This book will be of benefit to researchers engaged with artificial intelligence, and in particular agents, multiagent systems and nonmonotonic logic.

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. 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 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.

"This report investigates the question of the universality of classical logic. The approach is to show that an almost arbitrary logical system can be translated reasonably intuitively and almost automatically into classical logic. The path leading to this result goes through the analysis of what is reasonable logic, how to find semantics for it, how to build a labelled deductive system (LDS) for it, how to translate a LDS into classical logic and how to automate the process using SCAN. This report relies on other papers, published and/or to be published as explained in the acknowledgements.

The International workshop 'Frontiers of Combining Systems' is the only forum that is exclusively devoted to research efforts in this interdisciplinary area. This volume contains selected, edited papers from the second installment of the workshop. The contributions range from theorem proving, rewriting and logic to systems and constraints. While there is a clear emphasis on automated tools and logics, the contributions to this volume show that there exists a rapidly expanding body of solutions of particular instances of the combination problem, and at the same time, that the issue of developing general frameworks for intergrating formalisms and systems is taking on an increasingly important position on the international research agenda. The idea of combining formal systems and algorithms has been attracting interest in areas as diverse as constraint logic programming, automated deduction, verification, information retrieval, computational linguistics, artificial intelligence, and logic. As any interesting real world system is a complex composite entity, decomposing its descriptive requirements (for design, verification, or maintenance purposes) into simpler, more restricted tasks is appealing as it is often the only plausible way of tackling complex modelling problems. A core body of notions, questions and results is beginning to emerge in the area, and we are beginning to understand the computational and logical impact of combining methods and algorithms.

This volume constitutes the proceedings of the First International Conference on Temporal Logic (ICTL '94), held at Bonn, Germany in July 1994. Since its conception as a discipline thirty years ago, temporal logic is studied by many researchers of numerous backgrounds; presently it is in a stage of accelerated dynamic growth. This book, as the proceedings of the first international conference particularly dedicated to temporal logic, gives a thorough state-of-the-art report on all aspects of temporal logic research relevant for computer science and AI. It contains 27 technical contributions carefully selected for presentation at ICTL '94 as well as three surveys and position papers.

This text centers around three main subjects. The first is the concept of modularity and independence in classical logic and nonmonotonic and other nonclassical logic, and the consequences on syntactic and semantical interpolation and language change. In particular, we will show the connection between interpolation for nonmonotonic logic and manipulation of an abstract notion of size. Modularity is essentially the ability to put partial results achieved independently together for a global result. The second aspect of the book is the authors' uniform picture of conditionals, including many-valued logics and structures on the language elements themselves and on the truth value set. The third topic explained by the authors is neighbourhood semantics, their connection to independence, and their common points and differences for various logics, e.g., for defaults and deontic logic, for the limit version of preferential logics, and for general approximation"--Publisher.