Get Free Shipping on orders over $79
Set Theory for Computing : From Decision Procedures to Declarative Programming with Sets - Domenico Cantone

Set Theory for Computing

From Decision Procedures to Declarative Programming with Sets

By: Domenico Cantone, J.T. Schwartz (Foreword by), Eugenio Omodeo

Hardcover | 26 June 2001

At a Glance

Hardcover


$403.75

or 4 interest-free payments of $100.94 with

 or 

Ships in 10 to 15 business days

"Set Theory for Computing" provides a comprehensive account of set-oriented symbolic manipulation methods suitable for automated reasoning. Its main objective is twofold: 1) to provide a flexible formalization for a variety of set languages, and 2) to clarify the semantics of set constructs firmly established in modern specification languages and in the programming practice. Topics include: semantic unification, decision algorithms, modal logics, declarative programming, tableau-based proof techniques, and theory-based theorem proving. The style of presentation is self-contained, rigorous and accurate. Some familiarity with symbolic logic is helpful but not a requirement. This book is a useful resource for all advanced students, professionals, and researchers in computing sciences, artificial intelligence, automated reasoning, logic, and computational mathematics. It will serve to complement their intuitive understanding of set concepts with the ability to master them by symbolic and logically based algorithmic methods and deductive techniques.
Industry Reviews

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)

More in Compilers & Interpreters

Applied Mathematics with F# - Sudipta Mukherjee
Java in Two Semesters : Featuring JavaFX - Aaron Kans
Flex & Bison : O'Reilly Ser. - John Levine

RRP $57.00

$45.60

20%
OFF
NUnit Pocket Reference : Pocket Reference (O'Reilly) - Bill Hamilton
Compilers : Principles, Techniques, and Tools - Alfred Aho
Compilers : A Practical Approach - James E Jr Miller
Definitive ANTLR 4 Reference : 2nd Edition - Terence Parr
Crafting Interpreters - Robert Nystrom

RRP $87.99

$75.75

14%
OFF
Compiler Design Using Java® : An Object-Oriented Approach - John I. Moore
C++23 - The Complete Guide - Nicolai M. Josuttis