In this book the authors present new results on interpolation for nonmonotonic logics, abstract (function) independence, the Talmudic Kal Vachomer rule, and an equational solution of contrary-to-duty obligations. The chapter on formal construction is the conceptual core of the book, where the authors combine the ideas of several types of nonmonotonic logics and their analysis of 'natural' concepts into a formal logic, a special preferential construction that combines formal clarity with the intuitive advantages of Reiter defaults, defeasible inheritance, theory revision, and epistemic considerations. It is suitable for researchers in the area of computer science and mathematical logic.
This book is a specialized monograph on interpolation and definability, a notion central in pure logic and with significant meaning and applicability in all areas where logic is applied, especially computer science, artificial intelligence, logic programming, philosophy of science and natural language. Suitable for researchers and graduate students in mathematics, computer science and philosophy, this is the latest in the prestigous world-renowned Oxford Logic Guides, which contains Michael Dummet's Elements of intuitionism (second edition), J. M. Dunn and G. Hardegree's Algebraic Methods in Philosophical Logic, H. Rott's Change, Choice and Inference: A Study of Belief Revision and Nonmonotonic Reasoning, P. T. Johnstone's Sketches of an Elephant: A Topos Theory Compendium: Volumes 1 and 2, and David J. Pym and Eike Ritter's Reductive Logic and Proof Search: Proof theory, semantics and control.
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
Modern applications of logic, in mathematics, theoretical computer science, and linguistics, require combined systems involving many different logics working together. In this book the author offers a basic methodology for combining-or fibring-systems. This means that many existing complex systems can be broken down into simpler components, hence making them much easier to manipulate. Using this methodology the book discusses ways of obtaining a wide variety of multimodal, modal intuitionistic, modal substructural and fuzzy systems in a uniform way. It also covers self-fibred languages which allow formulae to apply to themselves. The book also studies sufficient conditions for transferring properties of the component logics into properties of the combined system.
Starting with simple examples showing the relevance of cutting and pasting logics, the monograph develops a mathematical theory of combining and decomposing logics, ranging from propositional and first-order based logics to higher-order based logics as well as to non-truth functional logics. The theory covers mechanisms for combining semantic structures and deductive systems either of the same or different nature. The issue of preservation of properties is addressed.
The present work is a continuation of the authors' acclaimed multi-volume APractical Logic of Cognitive Systems. After having investigated the notion ofrelevance in their previous volume, Gabbay and Woods now turn to abduction. Inthis highly original approach, abduction is construed as ignorance-preservinginference, in which conjecture plays a pivotal role. Abduction is a response to acognitive target that cannot be hit on the basis of what the agent currently knows.The abducer selects a hypothesis which were it true would enable the reasoner to attain his target. He concludes from this fact that the hypothesis may be conjectured. In allowing conjecture to stand in for the knowledge he fails to have, the abducer reveals himself to be a satisficer, since an abductive solution is not a solution from knowledge. Key to the authors' analysis is the requirement that a conjectured proposition is not just what a reasoner might allow himself to assume, but a proposition he must defeasibly release as a premiss for further inferences in the domain of enquiry in which the original abduction problem has arisen.The coverage of the book is extensive, from the philosophy of science tocomputer science and AI, from diagnostics to the law, from historical explanation to linguistic interpretation. One of the volume's strongest contributions is its exploration of the abductive character of criminal trials, with special attention given to the standard of proof beyond a reasonable doubt.Underlying their analysis of abductive reasoning is the authors' conception ofpractical agency. In this approach, practical agency is dominantly a matter of thecomparative modesty of an agent's cognitive agendas, together with comparatively scant resources available for their advancement. Seen in these ways, abduction has a significantly practical character, precisely because it is a form of inference that satisfices rather than maximizes its response to the agent's cognitive target.The Reach of Abduction will be necessary reading for researchers, graduatestudents and senior undergraduates in logic, computer science, AI, belief dynamics, argumentation theory, cognitive psychology and neuroscience, linguistics, forensic science, legal reasoning and related areas.Key features:- Reach of Abduction is fully integrated with a background logic of cognitive systems.- The most extensive coverage compared to competitive works.- Demonstrates not only that abduction is a form of ignorance preservinginference but that it is a mode of inference that is wholly rational.- Demonstrates the satisficing rather than maximizing character ofabduction.- The development of formal models of abduction is considerably more extensive than one finds in existing literature. It is an especially impressive amalgam of sophisticatedconceptual analysis and extensive logical modelling.· Reach of Abduction is fully integrated with a background logic of cognitive systems.· The most extensive coverage compared to competitive works· Demonstrates not only that abduction is a form of ignorance preservinginference but that it is a mode of inference that is wholly rational.· Demonstrates the satisficing rather than maximizing character ofabduction.· The development of formal models of abduction is considerably more extensive than one finds in existing literature. It is an especially impressive amalgam of sophisticatedconceptual analysis and extensive logical modelling.
This comprehensive book provides an adequate framework to establish various calculi of logical inference. Being an ?enriched? system of natural deduction, it helps to formulate logical calculi in an operational manner. By uncovering a certain harmony between a functional calculus on the labels and a logical calculus on the formulas, it allows mathematical foundations for systems of logic presentation designed to handle meta-level features at the object-level via a labelling mechanism, such as the D Gabbay's Labelled Deductive Systems. The book truly demonstrates that introducing ?labels? is useful to understand the proof-calculus itself, and also to clarify its connections with model-theoretic interpretations.
This book constitutes the refereed proceedings of the International Conference on Formal and Applied Practical Reasoning, FAPR '96, held in Bonn, Germany, in June 1996. The 51 revised full papers included in the book together with eight posters were carefully selected for presentation at the conference. The book addresses current aspects of the highly interdisciplinary area of practical reasoning in artificial intelligence, philosophy, psychology, linguistics, software engineering, intelligent systems, and industrial applications. Among the topics addressed are user modeling, belief, legal reasoning, argumentation, dialogue logic, default reasoning, analogy, metareasoning, temporal and procedural reasoning, and many others.
This book explores why, regarding practical reasoning, humans are sometimes still faster than artificial intelligence systems. It is the first to offer a self-contained presentation of neural network models for many computer science logics.
This text offers an extension to the traditional Kripke semantics for non-classical logics by adding the notion of reactivity. Reactive Kripke models change their accessibility relation as we progress in the evaluation process of formulas in the model. This feature makes the reactive Kripke semantics strictly stronger and more applicable than the traditional one. Here we investigate the properties and axiomatisations of this new and most effective semantics, and we offer a wide landscape of applications of the idea of reactivity. Applied topics include reactive automata, reactive grammars, reactive products, reactive deontic logic and reactive preferential structures. Reactive Kripke semantics is the next step in the evolution of possible world semantics for non-classical logics, and this book, written by one of the leading authorities in the field, is essential reading for graduate students and researchers in applied logic, and it offers many research opportunities for PhD students.
The Handbook of the Logic of Argument and Inference is an authoritative reference work in a single volume, designed for the attention of senior undergraduates, graduate students and researchers in all the leading research areas concerned with the logic of practical argument and inference. After an introductory chapter, the role of standard logics is surveyed in two chapters. These chapters can serve as a mini-course for interested readers, in deductive and inductive logic, or as a refresher. Then follow two chapters of criticism; one the internal critique and the other the empirical critique. The first deals with objections to standard logics (as theories of argument and inference) arising from the research programme in philosophical logic. The second canvasses criticisms arising from work in cognitive and experimental psychology. The next five chapters deal with developments in dialogue logic, interrogative logic, informal logic, probability logic and artificial intelligence. The last chapter surveys formal approaches to practical reasoning and anticipates possible future developments. Taken as a whole the Handbook is a single-volume indication of the present state of the logic of argument and inference at its conceptual and theoretical best. Future editions will periodically incorporate significant new developments.
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.
Goal Directed Proof Theory presents a uniform and coherent methodology for automated deduction in non-classical logics, the relevance of which to computer science is now widely acknowledged. The methodology is based on goal-directed provability. It is a generalization of the logic programming style of deduction, and it is particularly favourable for proof search. The methodology is applied for the first time in a uniform way to a wide range of non-classical systems, covering intuitionistic, intermediate, modal and substructural logics. The book can also be used as an introduction to these logical systems form a procedural perspective. Readership: Computer scientists, mathematicians and philosophers, and anyone interested in the automation of reasoning based on non-classical logics. The book is suitable for self study, its only prerequisite being some elementary knowledge of logic and proof theory.
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. The book will be of value to researchers and graduate students in logic and theoretical computer science.
An important aspect in the formalisation of common-sense reasoning is the construction of a model of what an agent believes the world to be like to help in her reasoning process. This model is often incomplete or inaccurate, but new information can be used to refine it. The study of techniques that achieve this in a rational way is the task of the discipline of belief revision, with which this book is concerned. There are three key elements to the book's approach. Firstly, the methodology of logic by translation. A specific instance of this is the idea of revision by translation. Revision for a foreign logic is done via its translation into a well-known logic, usually classic logic. Secondly, the technique of meta-level/object-level movement, where we bring some operation defined at the meta-level of a logic into its object level. In this book, we bring the operation of deletion to the object level. Finally, through Labelled Deductive Systems, we use the context of the revision to finetune its operation and illustrate the idea through the presentation of various algorithms. The book is suitable for researchers and postgraduates in the areas of artificial intelligence, database theory, and logic.
Quantification and modalities have always been topics of great interest for logicians. These two themes emerged from philosophy andlanguage in ancient times; they were studied by traditional informalmethods until the 20th century. In the last century the tools becamehighly mathematical, and both modal logic and quantification found numerous applications in Computer Science. At the same time many other kinds of nonclassical logics were investigated and applied to Computer Science. Although there exist several good books in propositional modal logics, this book is the first detailed monograph in nonclassical first-order quantification. It includes results obtained during the past thirty years. The field is very large, so we confine ourselves with only two kinds of logics: modal and superintuitionistic. The main emphasis of Volume 1 is model-theoretic, and it concentrates on descriptions of different sound semantics and completeness problem --- even for these seemingly simple questions we have our hands full. The major part of the presented material has never been published before. Some results are very recent, and for other results we either give new proofs or first proofs in full detail.
Fuzzy logics are many-valued logics that are well suited to reasoning in the context of vagueness. They provide the basis for the wider field of Fuzzy Logic, encompassing diverse areas such as fuzzy control, fuzzy databases, and fuzzy mathematics. This book provides an accessible and up-to-date introduction to this fast-growing and increasingly popular area. It focuses in particular on the development and applications of "proof-theoretic" presentations of fuzzy logics; the result of more than ten years of intensive work by researchers in the area, including the authors. In addition to providing alternative elegant presentations of fuzzy logics, proof-theoretic methods are useful for addressing theoretical problems (including key standard completeness results) and developing efficient deduction and decision algorithms. Proof-theoretic presentations also place fuzzy logics in the broader landscape of non-classical logics, revealing deep relations with other logics studied in Computer Science, Mathematics, and Philosophy. The book builds methodically from the semantic origins of fuzzy logics to proof-theoretic presentations such as Hilbert and Gentzen systems, introducing both theoretical and practical applications of these presentations.
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.
Artificial Intelligence is concerned with producing devices that help or replace human beings in their daily activities. Neural-symbolic learning systems play a central role in this task by combining, and trying to benefit from, the advantages of both the neural and symbolic paradigms of artificial intelligence. This book provides a comprehensive introduction to the field of neural-symbolic learning systems, and an invaluable overview of the latest research issues in this area. It is divided into three sections, covering the main topics of neural-symbolic integration - theoretical advances in knowledge representation and learning, knowledge extraction from trained neural networks, and inconsistency handling in neural-symbolic systems. Each section provides a balance of theory and practice, giving the results of applications using real-world problems in areas such as DNA sequence analysis, power systems fault diagnosis, and software requirements specifications. Neural-Symbolic Learning Systems will be invaluable reading for researchers and graduate students in Engineering, Computing Science, Artificial Intelligence, Machine Learning and Neurocomputing. It will also be of interest to Intelligent Systems practitioners and anyone interested in applications of hybrid artificial intelligence systems.
Quantification and modalities have always been topics of great interest for logicians. These two themes emerged from philosophy andlanguage in ancient times; they were studied by traditional informalmethods until the 20th century. In the last century the tools becamehighly mathematical, and both modal logic and quantification found numerous applications in Computer Science. At the same time many other kinds of nonclassical logics were investigated and applied to Computer Science. Although there exist several good books in propositional modal logics, this book is the first detailed monograph in nonclassical first-order quantification. It includes results obtained during the past thirty years. The field is very large, so we confine ourselves with only two kinds of logics: modal and superintuitionistic. The main emphasis of Volume 1 is model-theoretic, and it concentrates on descriptions of different sound semantics and completeness problem --- even for these seemingly simple questions we have our hands full. The major part of the presented material has never been published before. Some results are very recent, and for other results we either give new proofs or first proofs in full detail.
The Handbook of the Logic of Argument and Inference is an authoritative reference work in a single volume, designed for the attention of senior undergraduates, graduate students and researchers in all the leading research areas concerned with the logic of practical argument and inference. After an introductory chapter, the role of standard logics is surveyed in two chapters. These chapters can serve as a mini-course for interested readers, in deductive and inductive logic, or as a refresher. Then follow two chapters of criticism; one the internal critique and the other the empirical critique. The first deals with objections to standard logics (as theories of argument and inference) arising from the research programme in philosophical logic. The second canvasses criticisms arising from work in cognitive and experimental psychology. The next five chapters deal with developments in dialogue logic, interrogative logic, informal logic, probability logic and artificial intelligence. The last chapter surveys formal approaches to practical reasoning and anticipates possible future developments. Taken as a whole the Handbook is a single-volume indication of the present state of the logic of argument and inference at its conceptual and theoretical best. Future editions will periodically incorporate significant new developments.
Modern applications of logic, in mathematics, theoretical computer science, and linguistics, require combined systems involving many different logics working together. In this book the author offers a basic methodology for combining-or fibring-systems. This means that many existing complex systems can be broken down into simpler components, hence making them much easier to manipulate. Using this methodology the book discusses ways of obtaining a wide variety of multimodal, modal intuitionistic, modal substructural and fuzzy systems in a uniform way. It also covers self-fibred languages which allow formulae to apply to themselves. The book also studies sufficient conditions for transferring properties of the component logics into properties of the combined system.
The present work is a continuation of the authors' acclaimed multi-volume APractical Logic of Cognitive Systems. After having investigated the notion ofrelevance in their previous volume, Gabbay and Woods now turn to abduction. Inthis highly original approach, abduction is construed as ignorance-preservinginference, in which conjecture plays a pivotal role. Abduction is a response to acognitive target that cannot be hit on the basis of what the agent currently knows.The abducer selects a hypothesis which were it true would enable the reasoner to attain his target. He concludes from this fact that the hypothesis may be conjectured. In allowing conjecture to stand in for the knowledge he fails to have, the abducer reveals himself to be a satisficer, since an abductive solution is not a solution from knowledge. Key to the authors' analysis is the requirement that a conjectured proposition is not just what a reasoner might allow himself to assume, but a proposition he must defeasibly release as a premiss for further inferences in the domain of enquiry in which the original abduction problem has arisen.The coverage of the book is extensive, from the philosophy of science tocomputer science and AI, from diagnostics to the law, from historical explanation to linguistic interpretation. One of the volume's strongest contributions is its exploration of the abductive character of criminal trials, with special attention given to the standard of proof beyond a reasonable doubt.Underlying their analysis of abductive reasoning is the authors' conception ofpractical agency. In this approach, practical agency is dominantly a matter of thecomparative modesty of an agent's cognitive agendas, together with comparatively scant resources available for their advancement. Seen in these ways, abduction has a significantly practical character, precisely because it is a form of inference that satisfices rather than maximizes its response to the agent's cognitive target.The Reach of Abduction will be necessary reading for researchers, graduatestudents and senior undergraduates in logic, computer science, AI, belief dynamics, argumentation theory, cognitive psychology and neuroscience, linguistics, forensic science, legal reasoning and related areas.Key features:- Reach of Abduction is fully integrated with a background logic of cognitive systems.- The most extensive coverage compared to competitive works.- Demonstrates not only that abduction is a form of ignorance preservinginference but that it is a mode of inference that is wholly rational.- Demonstrates the satisficing rather than maximizing character ofabduction.- The development of formal models of abduction is considerably more extensive than one finds in existing literature. It is an especially impressive amalgam of sophisticatedconceptual analysis and extensive logical modelling.· Reach of Abduction is fully integrated with a background logic of cognitive systems.· The most extensive coverage compared to competitive works· Demonstrates not only that abduction is a form of ignorance preservinginference but that it is a mode of inference that is wholly rational.· Demonstrates the satisficing rather than maximizing character ofabduction.· The development of formal models of abduction is considerably more extensive than one finds in existing literature. It is an especially impressive amalgam of sophisticatedconceptual analysis and extensive logical modelling.
The present work is a continuation of the authors' acclaimed multi-volume A Practical Logic of Cognitive Systems. After having investigated the notion of relevance in their previous volume, Gabbay and Woods now turn to abduction. In this highly original approach, abduction is construed as ignorance-preserving inference, in which conjecture plays a pivotal role. Abduction is a response to a cognitive target that cannot be hit on the basis of what the agent currently knows. The abducer selects a hypothesis which were it true would enable the reasoner to attain his target. He concludes from this fact that the hypothesis may be conjectured. In allowing conjecture to stand in for the knowledge he fails to have, the abducer reveals himself to be a satisficer, since an abductive solution is not a solution from knowledge. Key to the authors' analysis is the requirement that a conjectured proposition is not just what a reasoner might allow himself to assume, but a proposition he must defeasibly release as a premiss for further inferences in the domain of enquiry in which the original abduction problem has arisen. The coverage of the book is extensive, from the philosophy of science to computer science and AI, from diagnostics to the law, from historical explanation to linguistic interpretation. One of the volume's strongest contributions is its exploration of the abductive character of criminal trials, with special attention given to the standard of proof beyond a reasonable doubt. Underlying their analysis of abductive reasoning is the authors' conception of practical agency. In this approach, practical agency is dominantly a matter of the comparative modesty of an agent's cognitive agendas, together with comparatively scant resources available for their advancement. Seen in these ways, abduction has a significantly practical character, precisely because it is a form of inference that satisfices rather than maximizes its response to the agent's cognitive target. The Reach of Abduction will be necessary reading for researchers, graduate students and senior undergraduates in logic, computer science, AI, belief dynamics, argumentation theory, cognitive psychology and neuroscience, linguistics, forensic science, legal reasoning and related areas. Key features: - Reach of Abduction is fully integrated with a background logic of cognitive systems. - The most extensive coverage compared to competitive works. - Demonstrates not only that abduction is a form of ignorance preserving inference but that it is a mode of inference that is wholly rational. - Demonstrates the satisficing rather than maximizing character of abduction. - The development of formal models of abduction is considerably more extensive than one finds in existing literature. It is an especially impressive amalgam of sophisticated conceptual analysis and extensive logical modelling. · Reach of Abduction is fully integrated with a background logic of cognitive systems. · The most extensive coverage compared to competitive works · Demonstrates not only that abduction is a form of ignorance preserving inference but that it is a mode of inference that is wholly rational. · Demonstrates the satisficing rather than maximizing character of abduction. · The development of formal models of abduction is considerably more extensive than one finds in existing literature. It is an especially impressive amalgam of sophisticated conceptual analysis and extensive logical modelling.
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
This will help us customize your experience to showcase the most relevant content to your age group
Please select from below
Login
Not registered?
Sign up
Already registered?
Success – Your message will goes here
We'd love to hear from you!
Thank you for visiting our website. Would you like to provide feedback on how we could improve your experience?
This site does not use any third party cookies with one exception — it uses cookies from Google to deliver its services and to analyze traffic.Learn More.