Set Theory for Computing - From Decision Procedures to Declarative Programming with Sets (Hardcover, 2001 ed.)

"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.

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	Monographs in Computer Science
Release date:	June 2001
First published:	2001
Authors:	Domenico Cantone
Foreword by:	J.T. Schwartz
Authors:	Eugenio Omodeo • Alberto Policriti
Dimensions:	235 x 155 x 23mm (L x W x T)
Format:	Hardcover
Pages:	409
Edition:	2001 ed.
ISBN-13:	978-0-387-95197-3
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Computing & IT > Computer programming > Programming languages > General Promotions
LSN:	0-387-95197-0
Barcode:	9780387951973

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!