Fuzzy knowledge and fuzzy systems affect our lives today as systems enter the world of commerce. Fuzzy systems are incorporated in domestic appliances (washing machine, air conditioning, microwave, telephone) and in transport systems (a pilotless helicopter has recently completed a test flight). Future applications are expected to have dramatic implications for the demand for labor, among other things. It was with such thoughts in mind that this first international survey of future applications of fuzzy logic has been undertaken. The results are likely to be predictive for a decade beyond the millenium. The predictive element is combined with a bibliography which serves as an historical anchor as well as being both extensive and extremely useful. Analysis and Evaluation of Fuzzy Systems is thus a milestone in the development of fuzzy logic and applications of three representative subsystems: Fuzzy Control, Fuzzy Pattern Recognition and Fuzzy Communications.

Alonzo Church was undeniably one ofthe intellectual giants of theTwenti- eth Century . These articles are dedicated to his memory and illustrate the tremendous importance his ideas have had in logic , mathematics, comput er science and philosophy . Discussions of some of thesevarious contributions have appeared in The Bulletin of Symbolic Logic, and th e interested reader is invited to seek details there . Here we justtry to give somegener al sense of the scope, depth,and value of his work. Church is perhaps best known for the theorem , appropriately called " C h u r c h ' s Theorem ", that there is no decision procedure forthelogical valid- ity of formulas first-order of logic . A d ecision proce dure forthat part of logic would have come near to fulfilling Leibniz's dream of a calculus that could be mechanically used tosettle logical disputes . It was not to . be It could not be . What Church proved precisely is that there is no lambda-definable function that can i n every case providethe right answer , ' y e s ' or ' n o', tothe question of whether or not any arbitrarily given formula is valid .

This book has a fundamental relationship to the International Seminar on Fuzzy Set Theory held each September in Linz, Austria. First, this volume is an extended account of the eleventh Seminar of 1989. Second, and more importantly, it is the culmination of the tradition of the preceding ten Seminars. The purpose of the Linz Seminar, since its inception, was and is to foster the development of the mathematical aspects of fuzzy sets. In the earlier years, this was accomplished by bringing together for a week small grou ps of mathematicians in various fields in an intimate, focused environment which promoted much informal, critical discussion in addition to formal presentations. Beginning with the tenth Seminar, the intimate setting was retained, but each Seminar narrowed in theme; and participation was broadened to include both younger scholars within, and established mathematicians outside, the mathematical mainstream of fuzzy sets theory. Most of the material of this book was developed over the years in close association with the Seminar or influenced by what transpired at Linz. For much of the content, it played a crucial role in either stimulating this material or in providing feedback and the necessary screening of ideas. Thus we may fairly say that the book, and the eleventh Seminar to which it is directly related, are in many respects a culmination of the previous Seminars.

One service mathematics bas rendered the 'Bt moi, .... si j'avait su comment en revenir, je human race. It bas put common sense back n'y semis point aU6.' where it belongs, on the topmost shelf next to Jules Verne the dusty canister labelled 'discarded nonsense'. BrieT.Bell The series is divergent; therefore we may be able to do something with it. O. Heaviside Mathematics is a tool for thought. A highly necessary tool in a world where both feedback and nonlineari ties abound. Similarly, all kinds of parts of mathematics serve as tools for other parts and for other sci ences. Applying a simple rewriting rule to the quote on the right above one finds such statements as: 'One ser vice topology has rendered mathematical physics .. .'; 'One service logic has rendered computer science .. .'; 'One service category theory has rendered mathematics .. .'. All arguably true. And all statements obtainable this way form part of the raison d' 8tre of this series."

We dedicate this volume to Professor Parimala on the occasion of her 60th birthday. It contains a variety of papers related to the themes of her research. Parimala's rst striking result was a counterexample to a quadratic analogue of Serre's conjecture (Bulletin of the American Mathematical Society, 1976). Her in uence has cont- ued through her tenure at the Tata Institute of Fundamental Research in Mumbai (1976-2006),and now her time at Emory University in Atlanta (2005-present). A conference was held from 30 December 2008 to 4 January 2009, at the U- versity of Hyderabad, India, to celebrate Parimala's 60th birthday (see the conf- ence's Web site at http://mathstat.uohyd.ernet.in/conf/quadforms2008). The or- nizing committee consisted of J.-L. Colliot-Thel ' en ' e, Skip Garibaldi, R. Sujatha, and V. Suresh. The present volume is an outcome of this event. We would like to thank all the participants of the conference, the authors who have contributed to this volume, and the referees who carefully examined the s- mitted papers. We would also like to thank Springer-Verlag for readily accepting to publish the volume. In addition, the other three editors of the volume would like to place on record their deep appreciation of Skip Garibaldi's untiring efforts toward the nal publication.

Adaptive Resonance Theory Microchips describes circuit strategies resulting in efficient and functional adaptive resonance theory (ART) hardware systems. While ART algorithms have been developed in software by their creators, this is the first book that addresses efficient VLSI design of ART systems. All systems described in the book have been designed and fabricated (or are nearing completion) as VLSI microchips in anticipation of the impending proliferation of ART applications to autonomous intelligent systems. To accommodate these systems, the book not only provides circuit design techniques, but also validates them through experimental measurements. The book also includes a chapter tutorially describing four ART architectures (ART1, ARTMAP, Fuzzy-ART and Fuzzy-ARTMAP) while providing easily understandable MATLAB code examples to implement these four algorithms in software. In addition, an entire chapter is devoted to other potential applications for real-time data clustering and category learning.

On the 26th of November 1992 the organizing committee gathered together, at Luigi Salce's invitation, for the first time. The tradition of abelian groups and modules Italian conferences (Rome 77, Udine 85, Bressanone 90) needed to be kept up by one more meeting. Since that first time it was clear to us that our goal was not so easy. In fact the main intended topics of abelian groups, modules over commutative rings and non commutative rings have become so specialized in the last years that it looked really ambitious to fit them into only one meeting. Anyway, since everyone of us shared the same mathematical roots, we did want to emphasize a common link. So we elaborated the long symposium schedule: three days of abelian groups and three days of modules over non commutative rings with a two days' bridge of commutative algebra in between. Many of the most famous names in these fields took part to the meeting. Over 140 participants, both attending and contributing the 18 Main Lectures and 64 Communications (see list on page xv) provided a really wide audience for an Algebra meeting. Now that the meeting is over, we can say that our initial feeling was right.

In The Foundations of Quantum Mechanics - Historical Analysis and Open Questions, leading Italian researchers involved in different aspects of the foundations and history of quantum mechanics are brought together in an interdisciplinary debate. The book therefore presents an invaluable overview of the state of Italian work in the field at this moment, and of the open problems that still exist in the foundations of the theory. Audience: Physicists, logicians, mathematicians and epistemologists whose research concerns the historical analysis of quantum mechanics.

As we stand at the precipice of the twenty first century the ability to capture and transmit copious amounts of information is clearly a defining feature of the human race. In order to increase the value of this vast supply of information we must develop means for effectively processing it. Newly emerging disciplines such as Information Engineering and Soft Computing are being developed in order to provide the tools required. Conferences such as the International Conference on Information Processing and ManagementofUncertainty in Knowledge-based Systems (IPMU) are being held to provide forums in which researchers can discuss the latest developments. The recent IPMU conference held at La Sorbonne in Paris brought together some of the world's leading experts in uncertainty and information fusion. In this volume we have included a selection ofpapers from this conference. What should be clear from looking at this volume is the number of different ways that are available for representing uncertain information. This variety in representational frameworks is a manifestation of the different types of uncertainty that appear in the information available to the users. Perhaps, the representation with the longest history is probability theory. This representation is best at addressing the uncertainty associated with the occurrence of different values for similar variables. This uncertainty is often described as randomness. Rough sets can be seen as a type of uncertainty that can deal effectively with lack of specificity, it is a powerful tool for manipulating granular information.

Text Retrieval and Filtering: Analytical Models of Performance is the first book that addresses the problem of analytically computing the performance of retrieval and filtering systems. The book describes means by which retrieval may be studied analytically, allowing one to describe current performance, predict future performance, and to understand why systems perform as they do. The focus is on retrieving and filtering natural language text, with material addressing retrieval performance for the simple case of queries with a single term, the more complex case with multiple terms, both with term independence and term dependence, and for the use of grammatical information to improve performance. Unambiguous statements of the conditions under which one method or system will be more effective than another are developed. Text Retrieval and Filtering: Analytical Models of Performance focuses on the performance of systems that retrieve natural language text, considering full sentences as well as phrases and individual words. The last chapter explicitly addresses how grammatical constructs and methods may be studied in the context of retrieval or filtering system performance. The book builds toward solving this problem, although the material in earlier chapters is as useful to those addressing non-linguistic, statistical concerns as it is to linguists. Those interested in grammatical information should be cautioned to carefully examine earlier chapters, especially Chapters 7 and 8, which discuss purely statistical relationships between terms, before moving on to Chapter 10, which explicitly addresses linguistic issues. Text Retrieval and Filtering: Analytical Models of Performance is suitable as a secondary text for a graduate level course on Information Retrieval or Linguistics, and as a reference for researchers and practitioners in industry.

Mathematics is often considered as a body of knowledge that is essen tially independent of linguistic formulations, in the sense that, once the content of this knowledge has been grasped, there remains only the problem of professional ability, that of clearly formulating and correctly proving it. However, the question is not so simple, and P. Weingartner's paper (Language and Coding-Dependency of Results in Logic and Mathe matics) deals with some results in logic and mathematics which reveal that certain notions are in general not invariant with respect to different choices of language and of coding processes. Five example are given: 1) The validity of axioms and rules of classical propositional logic depend on the interpretation of sentential variables; 2) The language dependency of verisimilitude; 3) The proof of the weak and strong anti inductivist theorems in Popper's theory of inductive support is not invariant with respect to limitative criteria put on classical logic; 4) The language-dependency of the concept of provability; 5) The language dependency of the existence of ungrounded and paradoxical sentences (in the sense of Kripke). The requirements of logical rigour and consistency are not the only criteria for the acceptance and appreciation of mathematical proposi tions and theories.

Modern algebra, which not long ago seemed to be a science divorced from real life, now has numerous applications. Many fine algebraic structures are endowed with meaningful contents. Now and then practice suggests new and unexpected structures enriching algebra. This does not mean that algebra has become merely a tool for applications. Quite the contrary, it significantly benefits from the new connections. The present book is devoted to some algebraic aspects of the theory of databases. It consists of three parts. The first part contains information about universal algebra, algebraic logic is the subject of the second part, and the third one deals with databases. The algebraic material of the flI'St two parts serves the common purpose of applying algebra to databases. The book is intended for use by mathematicians, and mainly by algebraists, who realize the necessity to unite theory and practice. It is also addressed to programmers, engineers and all potential users of mathematics who want to construct their models with the help of algebra and logic. Nowadays, the majority of professional mathematicians work in close cooperation with representatives of applied sciences and even industrial technology. It is neces sary to develop an ability to see mathematics in different particular situations. One of the tasks of this book is to promote the acquisition of such skills."

This book presents the general theory of categorical closure operators to gether with a number of examples, mostly drawn from topology and alge bra, which illustrate the general concepts in several concrete situations. It is aimed mainly at researchers and graduate students in the area of cate gorical topology, and to those interested in categorical methods applied to the most common concrete categories. Categorical Closure Operators is self-contained and can be considered as a graduate level textbook for topics courses in algebra, topology or category theory. The reader is expected to have some basic knowledge of algebra, topology and category theory, however, all categorical concepts that are recurrent are included in Chapter 2. Moreover, Chapter 1 contains all the needed results about Galois connections, and Chapter 3 presents the the ory of factorization structures for sinks. These factorizations not only are essential for the theory developed in this book, but details about them can not be found anywhere else, since all the results about these factorizations are usually treated as the duals of the theory of factorization structures for sources. Here, those hard-to-find details are provided. Throughout the book I have kept the number of assumptions to a min imum, even though this implies that different chapters may use different hypotheses. Normally, the hypotheses in use are specified at the beginning of each chapter and they also apply to the exercise set of that chapter."

Industrial development is essential to improvement of the standard of living in all countries. People's health and the environment can be affected, directly or indirectly by routine waste discharges or by accidents. A series of recent major industrial accidents and the effect of pollution highlighted, once again, the need for better management of routine and accidental risks. Moreover, the existence of natural hazards complicate even more the situation in any given region. In the past effort to cope with these risks, if made at all, have been largely on a plant by plant basis; some plants are well equipped to manage environmental and health hazards, while others are not. Managing the hazards of modern technological systems has become a key activity in highly industrialised countries. Decision makers are often confronted with complex issues concerning economic and social development, industrialisation and associated infrastructure needs, population and land use planning. Such issues have to be addressed in such a way that ensures that public health will not be disrupted or substantially degraded. Due to the increasing complexity of technological systems and the higher geographical density of punctual hazard sources, new methodologies and a novel approach to these problems are challenging risk managers and regional planers. Risks from these new complex technological systems are inherently different form those addressed by the risk managers for decades ago.

3. Textbook for a course in expert systems, if an emphasis is placed on Chapters 1 to 3 and on a selection of material from Chapters 4 to 7. There is also the option of using an additional commercially available sheU for a programming project. In assigning a programming project, the instructor may use any part of a great variety of books covering many subjects, such as car repair. Instructions for mostofthe "weekend mechanic" books are close stylisticaUy to expert system rules. Contents Chapter 1 gives an introduction to the subject matter; it briefly presents basic concepts, history, and some perspectives ofexpert systems. Then itpresents the architecture of an expert system and explains the stages of building an expert system. The concept of uncertainty in expert systems and the necessity of deal ing with the phenomenon are then presented. The chapter ends with the descrip tion of taxonomy ofexpert systems. Chapter 2 focuses on knowledge representation. Four basic ways to repre sent knowledge in expert systems are presented: first-order logic, production sys tems, semantic nets, and frames. Chapter 3 contains material about knowledge acquisition. Among machine learning techniques, a methodofrule learning from examples is explained in de tail. Then problems ofrule-base verification are discussed. In particular, both consistency and completeness oftherule base are presented."

The theory of constructive (recursive) models follows from works of Froehlich, Shepherdson, Mal'tsev, Kuznetsov, Rabin, and Vaught in the 50s. Within the framework of this theory, algorithmic properties of abstract models are investigated by constructing representations on the set of natural numbers and studying relations between algorithmic and structural properties of these models. This book is a very readable exposition of the modern theory of constructive models and describes methods and approaches developed by representatives of the Siberian school of algebra and logic and some other researchers (in particular, Nerode and his colleagues). The main themes are the existence of recursive models and applications to fields, algebras, and ordered sets (Ershov), the existence of decidable prime models (Goncharov, Harrington), the existence of decidable saturated models (Morley), the existence of decidable homogeneous models (Goncharov and Peretyat'kin), properties of the Ehrenfeucht theories (Millar, Ash, and Reed), the theory of algorithmic dimension and conditions of autostability (Goncharov, Ash, Shore, Khusainov, Ventsov, and others), and the theory of computable classes of models with various properties. Future perspectives of the theory of constructive models are also discussed. Most of the results in the book are presented in monograph form for the first time. The theory of constructive models serves as a basis for recursive mathematics. It is also useful in computer science, in particular, in the study of programming languages, higher level languages of specification, abstract data types, and problems of synthesis and verification of programs. Therefore, the book will be useful for not only specialists in mathematical logic and the theory of algorithms but also for scientists interested in the mathematical fundamentals of computer science. The authors are eminent specialists in mathematical logic. They have established fundamental results on elementary theories, model theory, the theory of algorithms, field theory, group theory, applied logic, computable numberings, the theory of constructive models, and the theoretical computer science.

Geometric properties and relations play central roles in the description and processing of spatial data. The properties and relations studied by mathematicians usually have precise definitions, but verbal descriptions often involve imprecisely defined concepts such as elongatedness or proximity. The methods used in soft computing provide a framework for formulating and manipulating such concepts. This volume contains eight papers on the soft definition and manipulation of spatial relations and gives a comprehensive summary on the subject.

Reasoning and Unification over Conceptual Graphs is an exploration of automated reasoning and resolution in the expanding field of Conceptual Structures. Designed not only for computing scientists researching Conceptual Graphs, but also for anyone interested in exploring the design of knowledge bases, the book explores what are proving to be the fundamental methods for representing semantic relations in knowledge bases. While it provides the first comprehensive treatment of Conceptual Graph unification and reasoning, the book also addresses fundamental issues of graph matching, automated reasoning, knowledge bases, constraints, ontology and design. With a large number of examples, illustrations, and both formal and informal definitions and discussions, this book is excellent as a tutorial for the reader new to Conceptual Graphs, or as a reference book for a senior researcher in Artificial Intelligence, Knowledge Representation or Automated Reasoning.

Domain theory is a rich interdisciplinary area at the intersection of logic, computer science, and mathematics. This volume contains selected papers presented at the International Symposium on Domain Theory which took place in Shanghai in October 1999. Topics of papers range from the encounters between topology and domain theory, sober spaces, Lawson topology, real number computability and continuous functionals to fuzzy modelling, logic programming, and pi-calculi. This book is a valuable reference for researchers and students interested in this rapidly developing area of theoretical computer science.

Fuzzy data such as marks, scores, verbal evaluations, imprecise observations, experts' opinions and grey tone pictures, are quite common. In Fuzzy Data Analysis the authors collect their recent results providing the reader with ideas, approaches and methods for processing such data when looking for sub-structures in knowledge bases for an evaluation of functional relationship, e.g. in order to specify diagnostic or control systems. The modelling presented uses ideas from fuzzy set theory and the suggested methods solve problems usually tackled by data analysis if the data are real numbers. Fuzzy Data Analysis is self-contained and is addressed to mathematicians oriented towards applications and to practitioners in any field of application who have some background in mathematics and statistics.

Formal Languages and Applications provides a comprehensive study-aid and self-tutorial for graduates students and researchers. The main results and techniques are presented in an readily accessible manner and accompanied by many references and directions for further research. This carefully edited monograph is intended to be the gateway to formal language theory and its applications, so it is very useful as a review and reference source of information in formal language theory.

This monograph covers the recent major advances in various areas of set theory.

From the reviews:

"One of the classical textbooks and reference books in set theory....The present Third Millennium edition...is a whole new book. In three parts the author offers us what in his view every young set theorist should learn and master....This well-written book promises to influence the next generation of set theorists, much as its predecessor has done." --MATHEMATICAL REVIEWS

The importance of having ef cient and effective methods for data mining and kn- ledge discovery (DM&KD), to which the present book is devoted, grows every day and numerous such methods have been developed in recent decades. There exists a great variety of different settings for the main problem studied by data mining and knowledge discovery, and it seems that a very popular one is formulated in terms of binary attributes. In this setting, states of nature of the application area under consideration are described by Boolean vectors de ned on some attributes. That is, by data points de ned in the Boolean space of the attributes. It is postulated that there exists a partition of this space into two classes, which should be inferred as patterns on the attributes when only several data points are known, the so-called positive and negative training examples. The main problem in DM&KD is de ned as nding rules for recognizing (cl- sifying) new data points of unknown class, i. e. , deciding which of them are positive and which are negative. In other words, to infer the binary value of one more attribute, called the goal or class attribute. To solve this problem, some methods have been suggested which construct a Boolean function separating the two given sets of positive and negative training data points.

From the Introduction: "We shall base our discussion on a set-theoretical foundation like that used in developing analysis, or algebra, or topology. We may consider our task as that of giving a mathematical analysis of the basic concepts of logic and mathematics themselves. Thus we treat mathematical and logical practice as given empirical data and attempt to develop a purely mathematical theory of logic abstracted from these data." There are 31 chapters in 5 parts and approximately 320 exercises marked by difficulty and whether or not they are necessary for further work in the book.

Quantitative Evaluation of Fire and EMS Mobilization Times presents comprehensive empirical data on fire emergency and EMS call processing and turnout times, and aims to improve the operational benchmarks of NFPA peer consensus standards through a close examination of real-world data. The book also identifies and analyzes the elements that can influence EMS mobilization response times. Quantitative Evaluation of Fire and EMS Mobilization Times is intended for practitioners as a tool for analyzing fire emergency response times and developing methods for improving them. Researchers working in a related field will also find the book valuable.