Set Theory for Computing: From Decision Procedures to Declarative Programming with Sets - Rilegato

Cantone, Domenico; Omodeo, Eugenio

Rilegato

ISBN 10: 0387951970 ISBN 13: 9780387951973

Casa editrice: Springer-Verlag GmbH, 2001

Riassunto

Set Theory for Computing offers an up-to-date and comprehensive account of set-oriented symbolic manipulation and automated reasoning methods. Mastering today's variety of systems with crisp, formal tools is a prerequisite for a high degree of control over sets and aggregates. The many algorithmic methods and deductive techniques in this book offer readers a clear view of the use of set-theoretic notions in such critical areas as specification of problems, data types, and solution methods; algorithmic program verification; and automated deduction. The rigorous and largely self-contained style of presentation addresses readers wanting to complement their set intuition with the ability to exploit it in specification and verification and master it by symbolic, logically based techniques and methods. This book will be of interest to graduates and researchers in theoretical computer science and computational logic and automated reasoning.

Su questo libro

Recensione

From the reviews:

"The book is an up-to-date and well-organized collection of techniques and results concerning the problem of dealing with sets in computer science. ... In particular, the book can be very interesting for postgraduate students and researchers in computer science and logic. ... The book is largely self-contained and the style of presentation is extremely rigorous and accurate. ... this will become a sort of classic work for automated deduction and declarative programming and surely it deserves to find a place in all scientific libraries." (A. Dovier, Theory and Practise of Logic Programming, Vol. 3 (1), 2003)

"Set theory has played the role of a lingua franca for modern mathematics. The authors of this monograph intend to extend this service to computer science, artificial intelligence, and computational mathematics. ... Several variants of ZF, which are meant for different applications, are surveyed and concrete, computable models are investigated. ... There is an extensive list of references, an index of symbols and an index of terms." (J.M. Plotkin, Zentralblatt MATH, Vol. 981, 2002)

Contenuti

What is Computable Set Theory? * Logical Background * Axiomatic Views of Aggregates * Semantic Views of Aggregates * Sets for Problem Solving * Decision Problems and Some Solutions * Inference Techniques and Methods * Set/Hyperset Unification Algorithms * A Syllogistic Solitaire * Stratified Syllogistics * Quantitative Set Reasoning * Set Theory for Non-Classical Logics * Logic Programming With Sets * Syllogistic Tableaux

Dettagli dell'edizione

• Editore: Springer-Verlag GmbH
• Data di pubblicazione: 2001
• Lingua: Inglese
• ISBN 10: 0387951970
• ISBN 13: 9780387951973
• Rilegatura: Copertina rigida
• Numero di pagine: 409
• Contatto del produttore: non disponibile
• Persona responsabile: ProductSafety@springernature.com; ProductSafety@springernature.com; ; Poststr. 9; Darmstadt; 64293; Germania