Advertisement

Set Theory for Computing

From Decision Procedures to Declarative Programming with Sets

  • Domenico Cantone
  • Eugenio Omodeo
  • Alberto Policriti

Part of the Monographs in Computer Science book series (MCS)

Table of contents

  1. Front Matter
    Pages i-xviii
  2. Introduction

    1. Front Matter
      Pages 1-1
    2. Domenico Cantone, Eugenio Omodeo, Alberto Policriti
      Pages 3-13
    3. Domenico Cantone, Eugenio Omodeo, Alberto Policriti
      Pages 14-58
  3. Basics for Set-Theoretic Reasoning

    1. Front Matter
      Pages 59-59
    2. Domenico Cantone, Eugenio Omodeo, Alberto Policriti
      Pages 61-86
    3. Domenico Cantone, Eugenio Omodeo, Alberto Policriti
      Pages 87-111
    4. Domenico Cantone, Eugenio Omodeo, Alberto Policriti
      Pages 112-147
    5. Domenico Cantone, Eugenio Omodeo, Alberto Policriti
      Pages 148-195
    6. Domenico Cantone, Eugenio Omodeo, Alberto Policriti
      Pages 196-244
  4. Decision Methods

    1. Front Matter
      Pages 245-245
    2. Domenico Cantone, Eugenio Omodeo, Alberto Policriti
      Pages 247-264
    3. Domenico Cantone, Eugenio Omodeo, Alberto Policriti
      Pages 265-283
    4. Domenico Cantone, Eugenio Omodeo, Alberto Policriti
      Pages 284-303
  5. Set-Specific Inference Engines

    1. Front Matter
      Pages 305-305
    2. Domenico Cantone, Eugenio Omodeo, Alberto Policriti
      Pages 307-317
    3. Domenico Cantone, Eugenio Omodeo, Alberto Policriti
      Pages 318-339
    4. Domenico Cantone, Eugenio Omodeo, Alberto Policriti
      Pages 340-349
    5. Domenico Cantone, Eugenio Omodeo, Alberto Policriti
      Pages 350-373
  6. Back Matter
    Pages 374-409

About this book

Introduction

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.

Keywords

Automat algorithms artificial intelligence automated deduction computer computer science logic programming sets theorem proving verification

Authors and affiliations

  • Domenico Cantone
    • 1
  • Eugenio Omodeo
    • 2
  • Alberto Policriti
    • 3
  1. 1.Dipartimento di Matematica e InformaticaUniversità di CataniaCataniaItaly
  2. 2.Dipartimento di Matematica Pura e ApplicataUniversità di L’AquilaL’AquilaItaly
  3. 3.Dipartimento di Matematica e InformaticaUniversità degli Studi di UdineUdineItaly

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4757-3452-2
  • Copyright Information Springer-Verlag New York 2001
  • Publisher Name Springer, New York, NY
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4419-2905-1
  • Online ISBN 978-1-4757-3452-2
  • Series Print ISSN 0172-603X
  • Buy this book on publisher's site
Industry Sectors
Automotive
Electronics
IT & Software
Telecommunications
Aerospace
Engineering