Connection tableau calculi with disjunctive constraints:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
1999
|
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | München, Techn. Univ., Diss., 1999 |
Beschreibung: | XVII, 214 S. |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV012821979 | ||
003 | DE-604 | ||
005 | 20000418 | ||
007 | t | ||
008 | 991021s1999 m||| 00||| eng d | ||
016 | 7 | |a 958032157 |2 DE-101 | |
035 | |a (OCoLC)643854878 | ||
035 | |a (DE-599)BVBBV012821979 | ||
040 | |a DE-604 |b ger |e rakwb | ||
041 | 1 | |h eng | |
049 | |a DE-91 |a DE-91G |a DE-12 | ||
084 | |a DAT 706d |2 stub | ||
100 | 1 | |a Ibens, Ortrun |e Verfasser |4 aut | |
245 | 1 | 0 | |a Connection tableau calculi with disjunctive constraints |c Ortrun Ibens |
264 | 1 | |c 1999 | |
300 | |a XVII, 214 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
500 | |a München, Techn. Univ., Diss., 1999 | ||
650 | 0 | 7 | |a Semantisches Tableau |0 (DE-588)4180950-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Automatisches Beweisverfahren |0 (DE-588)4069034-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Constraint-logische Programmierung |0 (DE-588)4382849-8 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
689 | 0 | 0 | |a Automatisches Beweisverfahren |0 (DE-588)4069034-9 |D s |
689 | 0 | 1 | |a Semantisches Tableau |0 (DE-588)4180950-6 |D s |
689 | 0 | 2 | |a Constraint-logische Programmierung |0 (DE-588)4382849-8 |D s |
689 | 0 | |5 DE-604 | |
856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008722519&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-008722519 |
Datensatz im Suchindex
_version_ | 1812461147009318912 |
---|---|
adam_text |
CONTENTS
1 INTRODUCTION 1
1.1 MOTIVATION. 1
1.2 OVERVIEW OF THE THESIS. 3
2 CONNECTION TABLEAU CALCULI 5
2.1 FIRST-ORDER CLAUSE LOGIC. 6
2.1.1 SYNTAX. 6
2.1.2 SEMANTICS. 9
2.2 TREES. 11
2.3 PROOF OBJECTS. 15
2.4 PROOF PROCEDURES. 17
2.4.1 THE INFERENCE RULES. 17
2.4.2 THE SEARCH SPACE. 20
2.4.3 SEARCH PROCEDURES . 25
3 DIVERGENCE IN THE SEARCH SPACE OF CONNECTION TABLEAU CALCULI 35
3.1 AVOIDANCE OF DIVERGENCE IN THE SEARCH SPACE. 35
3.2 PREVIOUS APPROACHES. 39
3.2.1 DATA-BASE UNIFICATION . 39
3.2.2 GENERALIZED PROPAGATION. 42
3.3 THE NEW APPROACH. 45
3.3.1 OUTLINES OF THE NEW APPROACH. 45
3.3.2 EFFECTS ON THE SEARCH SPACE. 47
3.3.3 SURVEY OF THE DEVELOPMENT OF THE NEW APPROACH . 49
4 CONSTRAINED-CONNECTION-TABLEAU CALCULI 51
4.1 FIRST-ORDER CONSTRAINED-CLAUSE LOGIC. 52
4.1.1 SYNTAX. 53
4.1.2 SEMANTICS. 55
4.2 PROOF OBJECTS. 58
4.3 PROOF PROCEDURES. 61
4.3.1 THE INFERENCE RULES. 61
4.3.2 THE SEARCH SPACE. 64
4.3.3 SEARCH PROCEDURES . 75
IX
BIBLIOGRAFISCHE INFORMATIONEN
HTTP://D-NB.INFO/958032157
4.4 SUMMARY AND DISCUSSION. 87
5 ALGORITHMS FOR CONSTRAINT ADMINISTRATION 88
5.1 CONSTRAINT GENERATION. 89
5.1.1 GENERATION OF CONSTRAINED CLAUSES. 89
5.1.2 OPTIMIZED GENERATION OF CONSTRAINED CLAUSES. 94
5.2 TREE REPRESENTATION OF CONSTRAINTS. 102
5.3 CONSTRAINT SIMPLIFICATION. 113
5.4 COMPUTATION OF SOLUTIONS . 117
5.4.1 FINITE-DOMAIN PROBLEM SOLVING. 117
5.4.2 RELATIONS BETWEEN FINITE-DOMAIN PROBLEMS AND CONSTRAINTS . 121
5.4.3 CONSTRAINT SOLVING USING BOTTOM-UP SELECTION. 127
5.4.4 CONSTRAINT SOLVING USING TOP-DOWN SELECTION. 142
5.4.5 COMPUTATION OF A FINITE REPRESENTATION OF ALL SOLUTIONS. 156
5.5 CONSTRAINT PREPROCESSING. 159
5.5.1 LOCAL SATISFIABILITY. 160
5.5.2 1-CONSISTENCY. 161
5.6 SUMMARY AND DISCUSSION. 168
6 REALIZATION OF PROOF PROCEDURES FOR CONSTRAINED-CONNECTION-TABLEAU
CALCULI 171
6.1 GENERATION OF CONSTRAINED CLAUSES . 172
6.2 CONSTRAINT REPRESENTATION IN CONSTRAINED-CONNECTION-TABLEAU SEARCH
TREES 172
6.2.1 CONSTRAINT SIMPLIFICATION. 173
6.2.2 1-CONSISTENCY PREPROCESSING. 174
6.2.3 LOCAL-SATISFIABILITY TEST . 175
6.3 CONSTRAINT SATISFIABILITY TESTING. 176
6.4 REALIZATION OF THE LOCAL FAILURE CACHING. 177
6.4.1 GENERATION OF ANTI-LEMMATA . 178
6.4.2 SUBSUMPTION TEST. 179
6.5 USE OF DETERMINISM. 180
6.6 SUMMARY AND DISCUSSION. 183
7 EVALUATION 186
7.1 IMPLEMENTATION. 186
7.1.1 THE CONNECTION TABLEAU PROVER
SETHEO. 187
7.1.2 THE CONSTRAINED-CONNECTION-TABLEAU PROVER C-SETHEO. 187
7.2 EXPERIMENTS. 188
X 7.2.1 EXPERIMENTS WITH PROBLEMS NOT INCLUDING EQUALITY. 189
7.2.2 EXPERIMENTS WITH PROBLEMS INCLUDING EQUALITY . 191
7.2.3 EXPERIMENTS WITH LEMMA USE. 192
7.3 SUMMARY AND DISCUSSION. 193
8 CONCLUSION 195
X
198
APPENDIX
BIBLIOGRAPHY
GLOSSARY OF SYMBOLS
INDEX
203
209
211
XI |
any_adam_object | 1 |
author | Ibens, Ortrun |
author_facet | Ibens, Ortrun |
author_role | aut |
author_sort | Ibens, Ortrun |
author_variant | o i oi |
building | Verbundindex |
bvnumber | BV012821979 |
classification_tum | DAT 706d |
ctrlnum | (OCoLC)643854878 (DE-599)BVBBV012821979 |
discipline | Informatik |
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">BV012821979</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20000418</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">991021s1999 m||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">958032157</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)643854878</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV012821979</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="1" ind2=" "><subfield code="h">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-12</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 706d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ibens, Ortrun</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Connection tableau calculi with disjunctive constraints</subfield><subfield code="c">Ortrun Ibens</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1999</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVII, 214 S.</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="500" ind1=" " ind2=" "><subfield code="a">München, Techn. Univ., Diss., 1999</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Semantisches Tableau</subfield><subfield code="0">(DE-588)4180950-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Automatisches Beweisverfahren</subfield><subfield code="0">(DE-588)4069034-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Constraint-logische Programmierung</subfield><subfield code="0">(DE-588)4382849-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Automatisches Beweisverfahren</subfield><subfield code="0">(DE-588)4069034-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Semantisches Tableau</subfield><subfield code="0">(DE-588)4180950-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Constraint-logische Programmierung</subfield><subfield code="0">(DE-588)4382849-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</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=008722519&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-008722519</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV012821979 |
illustrated | Not Illustrated |
indexdate | 2024-10-09T18:14:04Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-008722519 |
oclc_num | 643854878 |
open_access_boolean | |
owner | DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-12 |
owner_facet | DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-12 |
physical | XVII, 214 S. |
publishDate | 1999 |
publishDateSearch | 1999 |
publishDateSort | 1999 |
record_format | marc |
spelling | Ibens, Ortrun Verfasser aut Connection tableau calculi with disjunctive constraints Ortrun Ibens 1999 XVII, 214 S. txt rdacontent n rdamedia nc rdacarrier München, Techn. Univ., Diss., 1999 Semantisches Tableau (DE-588)4180950-6 gnd rswk-swf Automatisches Beweisverfahren (DE-588)4069034-9 gnd rswk-swf Constraint-logische Programmierung (DE-588)4382849-8 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Automatisches Beweisverfahren (DE-588)4069034-9 s Semantisches Tableau (DE-588)4180950-6 s Constraint-logische Programmierung (DE-588)4382849-8 s DE-604 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008722519&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Ibens, Ortrun Connection tableau calculi with disjunctive constraints Semantisches Tableau (DE-588)4180950-6 gnd Automatisches Beweisverfahren (DE-588)4069034-9 gnd Constraint-logische Programmierung (DE-588)4382849-8 gnd |
subject_GND | (DE-588)4180950-6 (DE-588)4069034-9 (DE-588)4382849-8 (DE-588)4113937-9 |
title | Connection tableau calculi with disjunctive constraints |
title_auth | Connection tableau calculi with disjunctive constraints |
title_exact_search | Connection tableau calculi with disjunctive constraints |
title_full | Connection tableau calculi with disjunctive constraints Ortrun Ibens |
title_fullStr | Connection tableau calculi with disjunctive constraints Ortrun Ibens |
title_full_unstemmed | Connection tableau calculi with disjunctive constraints Ortrun Ibens |
title_short | Connection tableau calculi with disjunctive constraints |
title_sort | connection tableau calculi with disjunctive constraints |
topic | Semantisches Tableau (DE-588)4180950-6 gnd Automatisches Beweisverfahren (DE-588)4069034-9 gnd Constraint-logische Programmierung (DE-588)4382849-8 gnd |
topic_facet | Semantisches Tableau Automatisches Beweisverfahren Constraint-logische Programmierung Hochschulschrift |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008722519&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
work_keys_str_mv | AT ibensortrun connectiontableaucalculiwithdisjunctiveconstraints |