Set Theory for Computing From Decision Procedures to Declarative Programming with Sets / by Domenico Cantone, Eugenio Omodeo, Alberto Policriti.

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

Full description

Saved in:

Bibliographic Details
Main Authors:	Cantone, Domenico (Author), Omodeo, Eugenio (Author), Policriti, Alberto (Author)
Corporate Author:	SpringerLink (Online service)
Format:	eBook
Language:	English
Published:	New York, NY : Springer New York : Imprint: Springer, 2001.
Edition:	1st ed. 2001.
Series:	Monographs in Computer Science, Springer eBook Collection.
Subjects:	Computers. Programming languages (Electronic computers). Computer science—Mathematics. Mathematical logic. Electronic resources (E-books)
Online Access:	Click to view e-book
Holy Cross Note:	Loaded electronically. Electronic access restricted to members of the Holy Cross Community.

Table of Contents:

1 What Is Computable Set Theory?
2 Logical Background
3 Axiomatic Views of Aggregates
4 Semantic Views of Aggregates
5 Sets for Problem Solving
6 Decision Problems and Some Solutions
7 Inference Techniques and Methods
8 Set/Hyperset Unification Algorithms
9 (*) A Syllogistic Solitaire
10 Stratified Syllogistics
11 Quantitative Set Reasoning
12 Set Theory for Nonclassic Logics
13 Logic Programming with Sets
14 Syllogistic Tableaux
References
Tables and Index of Symbols
Association and priority rules
Truth tables
Common abbreviations in first-order languages
Substitution-related notation
Map-related notation
Function-related notation
Basic laws on sets
Abbreviations in mathematical English
Index of Terms.

Set Theory for Computing From Decision Procedures to Declarative Programming with Sets / by Domenico Cantone, Eugenio Omodeo, Alberto Policriti.

Similar Items