Set theory for computing: from decision procedures to declarative programming with sets
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
New York ; Berlin ; Heidelberg ; Barcelona ; Hong Kong ; London
Springer
2001
|
Schriftenreihe: | Monographs in computer science
|
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | Literaturverz. S. 374 - 391 |
Beschreibung: | XVIII, 409 S. graph. Darst. : 24 cm |
ISBN: | 0387951970 |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV013993354 | ||
003 | DE-604 | ||
005 | 20020722 | ||
007 | t | ||
008 | 011030s2001 gw d||| |||| 00||| eng d | ||
016 | 7 | |a 962207233 |2 DE-101 | |
020 | |a 0387951970 |9 0-387-95197-0 | ||
035 | |a (OCoLC)248543978 | ||
035 | |a (DE-599)BVBBV013993354 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
044 | |a gw |c DE | ||
049 | |a DE-739 |a DE-634 | ||
050 | 0 | |a QA248 | |
082 | 0 | |a 511.3/22 |2 21 | |
084 | |a ST 300 |0 (DE-625)143650: |2 rvk | ||
100 | 1 | |a Cantone, Domenico |e Verfasser |4 aut | |
245 | 1 | 0 | |a Set theory for computing |b from decision procedures to declarative programming with sets |c Domenico Cantone ; Eugenio Omodeo ; Alberto Policriti |
264 | 1 | |a New York ; Berlin ; Heidelberg ; Barcelona ; Hong Kong ; London |b Springer |c 2001 | |
300 | |a XVIII, 409 S. |b graph. Darst. : 24 cm | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 0 | |a Monographs in computer science | |
500 | |a Literaturverz. S. 374 - 391 | ||
650 | 4 | |a Computable functions | |
650 | 4 | |a Set theory | |
650 | 0 | 7 | |a Deklarative Programmierung |0 (DE-588)4293503-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Berechenbare Funktion |0 (DE-588)4135762-0 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Mengenlehre |0 (DE-588)4074715-3 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Deklarative Programmierung |0 (DE-588)4293503-9 |D s |
689 | 0 | 1 | |a Mengenlehre |0 (DE-588)4074715-3 |D s |
689 | 0 | 2 | |a Berechenbare Funktion |0 (DE-588)4135762-0 |D s |
689 | 0 | |5 DE-604 | |
700 | 1 | |a Omodeo, Eugenio |e Verfasser |4 aut | |
700 | 1 | |a Policriti, Alberto |e Verfasser |4 aut | |
856 | 4 | 2 | |m HEBIS Datenaustausch Darmstadt |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009578281&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-009578281 |
Datensatz im Suchindex
_version_ | 1809768496417996800 |
---|---|
adam_text |
DOMENICO CANTONE EUGENIO OMODEO ALBERTO POLICRITI SET THEORY FOR
COMPUTING FROM DECISION PROCEDURES TO DECLARATIVE PROGRAMMING WITH SETS
FOREWORD BY JACOB T. SCHWARTZ WITH 67 FIGURES SPRINGER CONTENTS FOREWORD
VII PREFACE XI I INTRODUCTION 1 1 WHAT IS COMPUTABLE SET THEORY? 3 1.1
TENTATIVE SUBDIVISION OF COMPUTATIONAL LOGIC . 5 1.2 ONE OR SEVERAL
THEORIES ON SETS? 6 1.3 COMPUTABLE MODELS OF AGGREGATE THEORIES 8 1.4
DECIDABILITY ISSUES IN SET THEORY 9 1.5 FURTHER MEANS OF AUTOMATION FOR
REASONING ON AGGREGATES 11 1.6 APPLICATION SCENARIOS FOR COMPUTABLE SET
THEORY 12 2 LOGICAL BACKGROUND 14 2.1 FREE EXPRESSIONS OVER A SIGNATURE
. 16 2.2 PROPOSITIONAL CALCULUS 19 2.3 PREDICATE CALCULUS AND MAP
CALCULUS 28 2.4 THEORIES, IN VARIOUS FORMALISMS 49 XVI CONTENTS R II
BASICS FOR SET-THEORETIC REASONING 59 3 AXIOMATIC VIEWS OF AGGREGATES 61
3.1 THE BAREST RUDIMENTS OF SET THEORY 62 3.2 THE THEORY OF PURE FINITE
SETS 66 3.3 VARIANT AXIOMATIZATIONS OF AGGREGATE THEORIES 77 4 SEMANTIC
VIEWS OF AGGREGATES 87 4.1 UNIVERSES OF FINITE (NESTED) AGGREGATES 88
4.2 COMPUTABLE SET MODELS 97 4.3 APPENDIX: TINY-SETL PROGRAMS 108 5 SETS
FOR PROBLEM SOLVING 112 5.1 CONVENIENCES BASED ON NOTATION 112 5.2
SET-BASED CONCEPTUAL TOOLS 113 5.3 ABSTRACT CHARACTERIZATION OF DATA
TYPES 119 5.4 PROBLEM SPECIFICATIONS 124 5.5 SPECIFICATION OF ALGORITHMS
AND PROBLEM SOLUTION TECHNIQUES 128 5.6 SETS FOR PROGRAM VERIFICATION
130 5.7 DECLARATIVE SPECIFICATION OF A PROBLEM SOLUTION TECHNIQUE 138
5.8 (*) SYNTHESIS OF STRONGLY COMPUTABLE SET MODELS . . . . 142 6
DECISION PROBLEMS AND SOME SOLUTIONS 148 6.1 SATISFIABILITY AND VALIDITY
149 6.2 UNIFICATION UNDER GIVEN AXIOMS 168 6.3 TAXONOMY AND
NORMALIZATION OF FORMULAS 179 6.4 REVIEW OF SOLVABLE FRAGMENTS OF SET
THEORY 190 7 INFERENCE TECHNIQUES AND METHODS 196 7.1 RESOLUTION-LIKE
INFERENTIAL SYSTEMS 196 7.2 SEMANTIC TABLEAUX 207 7.3 LOGIC PROGRAMMING
AND ITS EXTENSIBILITY 223 III DECISION METHODS 245 8 SET/HYPERSET
UNIFICATION ALGORITHMS 247 8.1 BLIND-SEARCH UNIFICATION IN PURE CONTEXT
248 8.2 GOAL-DIRECTED SET-UNIFICATION IN THE BLENDED CONTEXT . . 256 8.3
(*) INGREDIENTS OF GOAL-DRIVEN HYPERSET UNIFICATION . . . 259 CONTENTS
XVII 9 -(*) A SYLLOGISTIC SOLITAIRE 265 9.1 DECIDING A FRAGMENT OF SET
THEORY BY SIMULATING A PARTITION 266 9.2 THE TRACE THEOREM 269 9.3
MIMICKING A SYLLOGISTIC GAME BY ONE OF PREDICTABLE LENGTH 275 9.4
SYLLOGISTIC GAMES APPLIED TO THE SET-SATISFIABILITY PROBLEM 281 10
STRATIFIED SYLLOGISTICS 284 10.1 TWO-LEVEL SYLLOGISTIC 284 10.2 (*)
TOPOLOGICAL TWO-LEVEL SYLLOGISTIC 287 10.3 THREE-LEVEL SYLLOGISTIC WITH
SINGLETON, POWERSET, AND UNIONSET 291 IV SET-SPECIFIC INFERENCE ENGINES
305 11 QUANTITATIVE SET REASONING 307 11.1 CASE STUDY: MULTILEVEL
SYLLOGISTIC WITH A CARDINALITY OPERATOR 307 11.2 A FURTHER EXTENSION OF
MULTILEVEL SYLLOGISTIC, WITH MAPS 313 11.3 REDUCTION OF MULTILEVEL
SYLLOGISTIC TO PROPOSITIONAL CALCULUS 314 12 SET THEORY FOR NONCLASSIC
LOGICS 318 12.1 MODAL LOGICS 318 12.2 TRANSLATION OF PROPOSITIONAL MODAL
FORMULAS INTO SET TERMS 322 12.3 ELICITING SET PRINCIPLES THAT ENSURE
FAITHFULNESS OF THE TRANSLATION 326 12.4 FAITHFULNESS OF THE TRANSLATION
IN MEANS OF PROOF . 327 12.5 SET-BASED RESOLUTION FOR NONCLASSIC
LOGICS 331 12.6 (*) OTHER LOGICS 335 13 LOGIC PROGRAMMING WITH SETS 340
13.1 AXIOMATIC DESCRIPTION OF THE BLENDED UNIVERSE OF SETS 341 13.2 A
VARIANT OF SLD-RESOLUTION SPECIALIZED FOR SET-HANDLING 342 14
SYLLOGISTIC TABLEAUX 350 14.1 A DECIDABLE TABLEAU CALCULUS FOR MLSS 351
14.2 EXTENDING MLSS WITH FUNCTION SYMBOLS AND RESTRICTED QUANTIFICATION
361 XVIII CONTENTS REFERENCES . . 3714 TABLES AND INDEX OF SYMBOLS 393
ASSOCIATION AND PRIORITY RULES 393 TRUTH TABLES . . 393 COMMON
ABBREVIATIONS IN FIRST-ORDER LANGUAGES 394 SUBSTITUTION-RELATED NOTATION
394 MAP-RELATED NOTATION 395 FUNCTION-RELATED NOTATION 395 BASIC LAWS ON
SETS . 396 ABBREVIATIONS IN MATHEMATICAL ENGLISH . . . 397 INDEX OF
TERMS 399 |
any_adam_object | 1 |
author | Cantone, Domenico Omodeo, Eugenio Policriti, Alberto |
author_facet | Cantone, Domenico Omodeo, Eugenio Policriti, Alberto |
author_role | aut aut aut |
author_sort | Cantone, Domenico |
author_variant | d c dc e o eo a p ap |
building | Verbundindex |
bvnumber | BV013993354 |
callnumber-first | Q - Science |
callnumber-label | QA248 |
callnumber-raw | QA248 |
callnumber-search | QA248 |
callnumber-sort | QA 3248 |
callnumber-subject | QA - Mathematics |
classification_rvk | ST 300 |
ctrlnum | (OCoLC)248543978 (DE-599)BVBBV013993354 |
dewey-full | 511.3/22 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 511 - General principles of mathematics |
dewey-raw | 511.3/22 |
dewey-search | 511.3/22 |
dewey-sort | 3511.3 222 |
dewey-tens | 510 - Mathematics |
discipline | Informatik Mathematik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV013993354</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20020722</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">011030s2001 gw d||| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">962207233</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387951970</subfield><subfield code="9">0-387-95197-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)248543978</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV013993354</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA248</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3/22</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 300</subfield><subfield code="0">(DE-625)143650:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cantone, Domenico</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Set theory for computing</subfield><subfield code="b">from decision procedures to declarative programming with sets</subfield><subfield code="c">Domenico Cantone ; Eugenio Omodeo ; Alberto Policriti</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York ; Berlin ; Heidelberg ; Barcelona ; Hong Kong ; London</subfield><subfield code="b">Springer</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVIII, 409 S.</subfield><subfield code="b">graph. Darst. : 24 cm</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Monographs in computer science</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 374 - 391</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computable functions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Set theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Deklarative Programmierung</subfield><subfield code="0">(DE-588)4293503-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechenbare Funktion</subfield><subfield code="0">(DE-588)4135762-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mengenlehre</subfield><subfield code="0">(DE-588)4074715-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Deklarative Programmierung</subfield><subfield code="0">(DE-588)4293503-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Mengenlehre</subfield><subfield code="0">(DE-588)4074715-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Berechenbare Funktion</subfield><subfield code="0">(DE-588)4135762-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Omodeo, Eugenio</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Policriti, Alberto</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HEBIS Datenaustausch Darmstadt</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009578281&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-009578281</subfield></datafield></record></collection> |
id | DE-604.BV013993354 |
illustrated | Illustrated |
indexdate | 2024-09-10T00:55:33Z |
institution | BVB |
isbn | 0387951970 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009578281 |
oclc_num | 248543978 |
open_access_boolean | |
owner | DE-739 DE-634 |
owner_facet | DE-739 DE-634 |
physical | XVIII, 409 S. graph. Darst. : 24 cm |
publishDate | 2001 |
publishDateSearch | 2001 |
publishDateSort | 2001 |
publisher | Springer |
record_format | marc |
series2 | Monographs in computer science |
spelling | Cantone, Domenico Verfasser aut Set theory for computing from decision procedures to declarative programming with sets Domenico Cantone ; Eugenio Omodeo ; Alberto Policriti New York ; Berlin ; Heidelberg ; Barcelona ; Hong Kong ; London Springer 2001 XVIII, 409 S. graph. Darst. : 24 cm txt rdacontent n rdamedia nc rdacarrier Monographs in computer science Literaturverz. S. 374 - 391 Computable functions Set theory Deklarative Programmierung (DE-588)4293503-9 gnd rswk-swf Berechenbare Funktion (DE-588)4135762-0 gnd rswk-swf Mengenlehre (DE-588)4074715-3 gnd rswk-swf Deklarative Programmierung (DE-588)4293503-9 s Mengenlehre (DE-588)4074715-3 s Berechenbare Funktion (DE-588)4135762-0 s DE-604 Omodeo, Eugenio Verfasser aut Policriti, Alberto Verfasser aut HEBIS Datenaustausch Darmstadt application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009578281&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Cantone, Domenico Omodeo, Eugenio Policriti, Alberto Set theory for computing from decision procedures to declarative programming with sets Computable functions Set theory Deklarative Programmierung (DE-588)4293503-9 gnd Berechenbare Funktion (DE-588)4135762-0 gnd Mengenlehre (DE-588)4074715-3 gnd |
subject_GND | (DE-588)4293503-9 (DE-588)4135762-0 (DE-588)4074715-3 |
title | Set theory for computing from decision procedures to declarative programming with sets |
title_auth | Set theory for computing from decision procedures to declarative programming with sets |
title_exact_search | Set theory for computing from decision procedures to declarative programming with sets |
title_full | Set theory for computing from decision procedures to declarative programming with sets Domenico Cantone ; Eugenio Omodeo ; Alberto Policriti |
title_fullStr | Set theory for computing from decision procedures to declarative programming with sets Domenico Cantone ; Eugenio Omodeo ; Alberto Policriti |
title_full_unstemmed | Set theory for computing from decision procedures to declarative programming with sets Domenico Cantone ; Eugenio Omodeo ; Alberto Policriti |
title_short | Set theory for computing |
title_sort | set theory for computing from decision procedures to declarative programming with sets |
title_sub | from decision procedures to declarative programming with sets |
topic | Computable functions Set theory Deklarative Programmierung (DE-588)4293503-9 gnd Berechenbare Funktion (DE-588)4135762-0 gnd Mengenlehre (DE-588)4074715-3 gnd |
topic_facet | Computable functions Set theory Deklarative Programmierung Berechenbare Funktion Mengenlehre |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009578281&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
work_keys_str_mv | AT cantonedomenico settheoryforcomputingfromdecisionprocedurestodeclarativeprogrammingwithsets AT omodeoeugenio settheoryforcomputingfromdecisionprocedurestodeclarativeprogrammingwithsets AT policritialberto settheoryforcomputingfromdecisionprocedurestodeclarativeprogrammingwithsets |