Cantitate/Preț
Produs

Dynamic Epistemic Logic (Synthese Library, nr. 337)

De (autor) , ,
Notă GoodReads:
en Limba Engleză Carte Hardback – 08 Jun 2007
Dynamic Epistemic Logic is the logic of knowledge change. This is not about one logical system, but about a whole family of logics that allows us to specify static and dynamic aspects of multi-agent systems. This book provides various logics to support such formal specifications, including proof systems. Concrete examples and epistemic puzzles enliven the exposition. The book also contains exercises including answers and is eminently suitable for graduate courses in logic.
A sweeping chapter-wise outline of the content of this book is the following. The chapter 'Introduction' informs the reader about the history of the subject, and its relation to other disciplines. 'Epistemic Logic' is an overview of multi-agent epistemic logic - the logic of knowledge - including modal operators for groups, such as general and common knowledge. 'Belief Revision' is an overview on how to model belief revision, both in the 'traditional' way and in a dynamic epistemic setting. 'Public Announcements' is a detailed and comprehensive introduction to the logic of knowledge to which dynamic operators for truthful public announcement are added. Many interesting applications are also presented in this chapter: a form of cryptography for ideal agents also known as 'the Russian cards problem', the sum-and-product riddle, etc. 'Epistemic Actions' introduces a generalization of public announcement logic to more complex epistemic actions. A different perspective on that matter is independently presented in 'Action Models'. 'Completeness' gives details on the completeness proof for the logics introduced in 'Epistemic Logic', 'Public Announcements', and 'Action Models'. 'Expressivity' discusses various results on the expressive power of the logics presented.
Citește tot Restrânge
Toate formatele și edițiile
Toate formatele și edițiile Preț Express
Carte Paperback (1) 37416 lei  Economic 5-7 săpt. +6978 lei  10-18 zile
  SPRINGER NETHERLANDS – 15 Nov 2007 37416 lei  Economic 5-7 săpt. +6978 lei  10-18 zile
Carte Hardback (1) 69769 lei  Economic 5-7 săpt. +21433 lei  10-18 zile
  SPRINGER NETHERLANDS – 08 Jun 2007 69769 lei  Economic 5-7 săpt. +21433 lei  10-18 zile

Din seria Synthese Library

Preț: 69769 lei

Preț vechi: 75020 lei
-7%

Puncte Express: 1047

Preț estimativ în valută:
14042 15839$ 12609£

Carte tipărită la comandă

Livrare economică 20 august-03 septembrie
Livrare express 26 iulie-03 august pentru 22432 lei

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781402058387
ISBN-10: 1402058381
Pagini: 312
Ilustrații: 1
Dimensiuni: 155 x 235 x 30 mm
Greutate: 1.36 kg
Ediția: 2008
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Synthese Library

Locul publicării: Dordrecht, Netherlands

Public țintă

Research

Cuprins

Epistemic Logic.- Belief Revision.- Public Announcements.- Epistemic Actions.- Action Models.- Completeness.- Expressivity.

Recenzii

From the reviews:
"I am very glad to see that three people so active in this area of knowledge update are bringing out this book. It should be of great help to graduate students as well as established researchers." Rohit Parikh, Distinguished Professor, City University of New York
"The book exhaustively establishes the 2006 state of the art in the DEL, and provides relevant pointers towards the artificial intelligence and theoretical computer science literature. Such a collection did not exist up to now for that dynamic extension of EL, and the book therefore fills a gap. As such it is a precious and highly welcome tool for researchers in all these fields. It is moreover very well-written: the relevant concepts are explained in detail and illustrated by means of examples … ." (Andreas Herzig, Studia Logica, Vol. 89, 2008)

Textul de pe ultima copertă

Dynamic Epistemic Logic is the logic of knowledge change. This is not about one logical system, but about a whole family of logics that allows us to specify static and dynamic aspects of multi-agent systems. This book provides various logics to support such formal specifications, including proof systems. Concrete examples and epistemic puzzles enliven the exposition. The book also contains exercises including answers and is eminently suitable for graduate courses in logic.
A sweeping chapter-wise outline of the content of this book is the following. The chapter 'Introduction' informs the reader about the history of the subject, and its relation to other disciplines. 'Epistemic Logic' is an overview of multi-agent epistemic logic - the logic of knowledge - including modal operators for groups, such as general and common knowledge. 'Belief Revision' is an overview on how to model belief revision, both in the 'traditional' way and in a dynamic epistemic setting. 'Public Announcements' is a detailed and comprehensive introduction into the logic of knowledge to which dynamic operators for truthful public announcement are added. Many interesting applications are also presented in this chapter: a form of cryptography for ideal agents also known as 'the russian cards problem', the sum-and-product riddle, etc. 'Epistemic Actions' introduces a generalization of public announcement logic to more complex epistemic actions. A different perspective on that matter is independently presented in 'Action Models'. 'Completeness' gives details on the completeness proof for the logics introduced in 'Epistemic Logic', 'Public Announcements', and 'Action Models'. 'Expressivity' discusses various results on the expressive power of the logics presented.


"I am very glad to see that three people so active in this area of knowledge update are bringing out this book. It should be of great help to graduate students as well as established researchers." Rohit Parikh, Distinguished Professor, City University of New York

Caracteristici

The first accessible reference to public announcement logic
Eminently suitable textbook for a graduate audience
Companion webpage with slides for lecturers, exams for further practice, etc.
Everything you always wanted to know about the muddy children problem
Many examples, exercises, and thorough completeness proofs and expressivity results