Muutke küpsiste eelistusi

Logical Tools for Handling Change in Agent-Based Systems [Kõva köide]

  • Formaat: Hardback, 305 pages, kõrgus x laius: 235x155 mm, kaal: 641 g, 26 Illustrations, black and white; X, 305 p. 26 illus., 1 Hardback
  • Sari: Cognitive Technologies
  • Ilmumisaeg: 15-Dec-2009
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642044069
  • ISBN-13: 9783642044069
Teised raamatud teemal:
  • Kõva köide
  • Hind: 141,35 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 166,29 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Hardback, 305 pages, kõrgus x laius: 235x155 mm, kaal: 641 g, 26 Illustrations, black and white; X, 305 p. 26 illus., 1 Hardback
  • Sari: Cognitive Technologies
  • Ilmumisaeg: 15-Dec-2009
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642044069
  • ISBN-13: 9783642044069
Teised raamatud teemal:
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 covers general logical tools for handling change. The tools are preferential reasoning, theory revision and reasoning in inheritance systems. Logics examined are nonmonotonic, deontic, modal, intuitionistic and temporal as well as counterfactuals.

Arvustused

From the reviews:

"I welcome this book and its attempt to bring systematic, reductive, and semantical order to a field that has had many different approaches, written by two well-established researchers in this area and other related areas of technical work on philosophically and epistemically motivated logics." Saul Kripke (The City University of New York)

This book covers a broad range of ideas related to nonmonotonic reasoning. This review summarizes some of its nice ideas--or, as the authors say, its logical tools. It would be fair to call this whole book an exposition on reactive diagrams in various application areas. there is substantial material for researchers. the book is primarily concerned with semantic structures. (K. Lodaya, ACM Computing Reviews, February, 2011)

The book gives a very solid and comprehensive overview of various logics. It focuses on mapping of the logics to the formalism of reactive diagrams. The book is especially suited for logicians and researchers seeking to establish a rigorous theoretical foundation for their reasoning systems, or who are interested in comparing different reasoning systems on the basis of a common ground. (Jana Köhler, Zentralblatt MATH, Vol. 1215, 2011)

Introduction and Motivation
1(30)
Programme
1(1)
Short Overview of the Different Logics
2(8)
Nonmonotonic Logics
2(1)
Theory Revision
3(1)
Theory Update
4(2)
Deontic Logic
6(1)
Counterfactual Conditionals
6(1)
Modal Logic
7(1)
Intuitionistic Logic
8(1)
Inheritance Systems
8(1)
A Summarizing Table for the Semantics
8(2)
A Discussion of Concepts
10(11)
Basic Semantic Entities, Truth Values, and Operators
10(2)
Algebraic and Structural Semantics
12(3)
Restricted Operators and Relations
15(1)
Copies in Preferential Models
16(1)
Further Remarks on Universality of Representation Proofs
17(1)
In the Object Language?
17(3)
Various Considerations on Abstract Semantics
20(1)
A Comparison with Reiter Defaults
21(1)
IBRS
21(10)
Definition and Comments
21(4)
The Power of IBRS
25(1)
Abstract Semantics for IBRS and Its Engineering Realization
26(5)
Basic Definitions and Results
31(22)
Algebraic Definitions
31(3)
Basic Logical Definitions
34(1)
Basic Definitions and Results for Nonmonotonic Logics
35(18)
Abstract Semantics by Size
53(20)
The First-Order Setting
53(1)
General Size Semantics
54(19)
Introduction
54(1)
Main Table
55(9)
Coherent Systems
64(5)
Size and Principal Filter Logic
69(4)
Preferential Structures - Part I
73(46)
Introduction
73(14)
Remarks on Nonmonotonic Logics and Preferential Semantics
73(4)
Basic Definitions
77(10)
Preferential Structures Without Domain Conditions
87(32)
General Discussion
87(7)
Detailed Discussion
94(25)
Preferential Structures - Part II
119(38)
Simplifications by Domain Conditions, Logical Properties
119(6)
Introduction
119(1)
Smooth Structures
119(4)
Ranked Structures
123(1)
The Logical Properties with Definability Preservation
124(1)
A-Ranked Structures
125(6)
Representation Results for A-Ranked Structures
125(6)
Two-Sequent Calculi
131(3)
Introduction
131(1)
Plausibility Logic
131(2)
A Comment on the Work by Arieli and Avron
133(1)
Blurred Observation - Absence of Definability Preservation
134(11)
Introduction
134(4)
General and Smooth Structures Without Definability Preservation
138(5)
Ranked Structures
143(2)
The Limit Variant
145(12)
Introduction
145(2)
The Algebraic Limit
147(2)
The Logical Limit
149(8)
Higher Preferential Structures
157(18)
Introduction
157(5)
The General Case
162(5)
Discussion of the Totally Smooth Case
167(2)
The Essentially Smooth Case
169(4)
Translation to Logic
173(2)
Deontic Logic and Hierarchical Conditionals
175(44)
Semantics of Deontic Logic
175(23)
Introductory Remarks
175(4)
Basic Definitions
179(7)
Philosophical Discussion of Obligations
186(7)
Examination of the Various Cases
193(4)
What Is An Obligation?
197(1)
Conclusion
198(1)
A Comment on Work by Aqvist
198(7)
Introduction
198(1)
There Are (At Least) Two Solutions
199(2)
Outline
201(4)
Gm T A Implies G T A (Outline)
205(1)
Hierarchical Conditionals
205(14)
Introduction
205(4)
Formal Modelling and Summary of Results
209(2)
Overview
211(1)
Connections with Other Concepts
212(2)
Formal Results and Representation for Hierarchical Conditionals
214(5)
Theory Update and Theory Revision
219(32)
Update
219(8)
Introduction
219(1)
Hidden Dimensions
219(8)
Theory Revision
227(24)
Introduction to Theory Revision
227(9)
Booth Revision
236(8)
Revision and Independence
244(5)
Preferential Modelling of Defaults
249(1)
Remarks on Independence
250(1)
An Analysis of Defeasible Inheritance Systems
251(44)
Introduction
251(7)
Terminology
251(1)
Inheritance and Reactive Diagrams
251(6)
Conceptual Analysis
257(1)
Introduction to Nonmonotonic Inheritance
258(12)
Basic Discussion
258(4)
Directly Sceptical Split Validity Upward Chaining Off-Path Inheritance
262(7)
Review of Other Approaches and Problems
269(1)
Defeasible Inheritance and Reactive Diagrams
270(5)
Summary of Our Algorithm
270(2)
Overview
272(1)
Compilation and Memorization
273(1)
Executing the Algorithm
273(1)
Signposts
274(1)
Beyond Inheritance
274(1)
Interpretations
275(9)
Introduction
275(1)
Informal Comparison of Inheritance with the Systems P and R
276(1)
Inheritance as Information Transfer
277(4)
Inheritance as Reasoning with Prototypes
281(3)
Detailed Translation of Inheritance to Modified Systems of Small Sets
284(11)
Normality
284(1)
Small Sets
285(10)
Bibliography 295(4)
Index 299