The efficiency of theorem proving strategies: a comparative and asymptotic analysis
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Braunschweig ; Wiesbaden
Vieweg
1999
|
Ausgabe: | 2., rev. ed. |
Schriftenreihe: | Computational intelligence
|
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | Literaturverz. S. 157 - 163 |
Beschreibung: | VIII, 170 S. graph. Darst. 21 cm |
ISBN: | 3528155744 |
Internformat
MARC
LEADER | 00000nam a2200000zc 4500 | ||
---|---|---|---|
001 | BV023521829 | ||
003 | DE-604 | ||
005 | 20080625000000.0 | ||
007 | t | ||
008 | 000518s1999 gw d||| |||| 00||| eng d | ||
015 | |a 99,N43,0349 |2 dnb | ||
015 | |a 00,A01,0711 |2 dnb | ||
016 | 7 | |a 957567553 |2 DE-101 | |
020 | |a 3528155744 |c kart. : DM 58.00 |9 3-528-15574-4 | ||
035 | |a (OCoLC)264400894 | ||
035 | |a (DE-599)BVBBV023521829 | ||
040 | |a DE-604 |b ger | ||
041 | 0 | |a eng | |
044 | |a gw |c XA-DE-NI | ||
049 | |a DE-521 |a DE-634 |a DE-11 | ||
084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
084 | |a ST 304 |0 (DE-625)143653: |2 rvk | ||
084 | |a 28 |2 sdnb | ||
100 | 1 | |a Plaisted, David A. |e Verfasser |4 aut | |
245 | 1 | 0 | |a The efficiency of theorem proving strategies |b a comparative and asymptotic analysis |c David A. Plaisted ; Yunshan Zhu |
250 | |a 2., rev. ed. | ||
264 | 1 | |a Braunschweig ; Wiesbaden |b Vieweg |c 1999 | |
300 | |a VIII, 170 S. |b graph. Darst. |c 21 cm | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 0 | |a Computational intelligence | |
500 | |a Literaturverz. S. 157 - 163 | ||
650 | 0 | 7 | |a Automatisches Beweisverfahren |0 (DE-588)4069034-9 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Automatisches Beweisverfahren |0 (DE-588)4069034-9 |D s |
689 | 0 | |5 DE-604 | |
700 | 1 | |a Zhu, Yunshan |e Verfasser |4 aut | |
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=016842121&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
999 | |a oai:aleph.bib-bvb.de:BVB01-016842121 |
Datensatz im Suchindex
_version_ | 1804138163019448320 |
---|---|
adam_txt |
CONTENTS
PREFACE
VII
1
THE
PROPOSITIONAL
COMPLEXITY
OF
FIRST-ORDER
THEOREM
PROVING
STRATEGIES
1
1.1
INTRODUCTION
.
1
1.2
FIRST
ORDER
LOGIC
AND
REFUTATIONAL
THEOREM
PROVING
.
.
7
1.3
SEARCH
SPACE
FORMALISM
.
8
1.4
MEASURES
OF
SEARCH
DUPLICATION
.
9
1.5
ANALYSIS
OF
DUPLICATION
FOR
VARIOUS
STRATEGIES
.
13
1.5.1
HARD
SETS
OF
CLAUSES
FOR
THE
STRATEGIES
.
16
1.5.2
HYPER-RESOLUTION
.
22
1.5.3
PI
DEDUCTION
.
23
1.5.4
A-ORDERING
.
24
1.5.5
IMPLICATIONS
FOR
TERM
REWRITING
.
27
1.5.6
PROOF
DAGS
.
28
1.5.7
OTHER
PROPERTIES
OF
CLAUSE
SETS
.
29
1.5.8
ALL-NEGATIVE
RESOLUTION
.
29
1.5.9
ALL-NEGATIVE
RESOLUTION
WITH
ORDERING
.
31
1.5.10
A-ORDERING
AND
PROOF
DAGS
.
40
1.5.11
SLD-RESOLUTION
.
49
1.5.12
SET
OF
SUPPORT
.
51
1.5.13
MODEL
ELIMINATION
.
52
1.5.14
LEMMAS
AND
CACHING
.
53
1.5.15
THE
MESON
STRATEGY
.
55
1.5.16
PROBLEM
REDUCTION
FORMATS
.
55
1.5.17
CLAUSE
LINKING
.
56
1.5.18
CONNECTION
CALCULI
.
56
1.5.19
CACHING
.
57
1.6
PREVENTING
UNIT
SIMPLIFICATIONS
.
57
1.7
ADDITIONAL
HARD
SETS
OF
CLAUSES
.
58
1.8
DISCUSSION
.
62
1.8.1
ADEQUACY
.
63
1.8.2
EXTENSIONS
.
64
2
THE
FIRST-ORDER
COMPLEXITY
OF
FIRST-ORDER
THEOREM
PROVING
STRATEGIES
67
2.1
INTRODUCTION
.
67
2.2
PROOF
COMPLEXITY
MEASURES
.
72
2.3
INHERENT
COMPLEXITIES
.
85
2.4
INFERENCE
BASED
MEASURES
.
87
2.4.1
RESOLUTION
BASED
METHODS
.
93
2.4.2
MODEL
ELIMINATION
.
98
2.5
THE
DUPLICATION
MEASURE
.
100
2.5.1
CLAUSE
LINKING
.
100
2.5.2
RESOLUTION
BASED
METHODS
.
119
2.5.3
BRITISH
MUSEUM
METHODS
.
123
2.5.4
OTHER
METHODS
.
125
2.6
THE
SUBTERM
SIZE
MEASURE
.
127
2.6.1
CLAUSE
LINKING
.
128
2.6.2
RESOLUTION
.
131
2.6.3
BRITISH
MUSEUM
METHODS
.
132
2.6.4
OTHER
METHODS
.
134
2.7
THE
LINEAR
SIZE
MEASURE
.
136
2.8
SETS
WITH
LARGE
LITERALS
.
138
2.9
UNIT
RESOLVABLE
CLAUSE
SETS
.
141
2.10
IMPLICATIONS
FOR
CHOICE
OF
STRATEGY
.
142
2.11
RELATIONS
AMONG
COMPLEXITY
MEASURES
.
148
2.12
CONCLUSIONS
AND
FUTURE
WORK
.
154
BIBLIOGRAPHY
157
INDEX
164 |
any_adam_object | 1 |
any_adam_object_boolean | 1 |
author | Plaisted, David A. Zhu, Yunshan |
author_facet | Plaisted, David A. Zhu, Yunshan |
author_role | aut aut |
author_sort | Plaisted, David A. |
author_variant | d a p da dap y z yz |
building | Verbundindex |
bvnumber | BV023521829 |
classification_rvk | SK 130 ST 304 |
ctrlnum | (OCoLC)264400894 (DE-599)BVBBV023521829 |
discipline | Informatik Mathematik |
discipline_str_mv | Informatik Mathematik |
edition | 2., rev. ed. |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01642nam a2200433zc 4500</leader><controlfield tag="001">BV023521829</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20080625000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">000518s1999 gw d||| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">99,N43,0349</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">00,A01,0711</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">957567553</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3528155744</subfield><subfield code="c">kart. : DM 58.00</subfield><subfield code="9">3-528-15574-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)264400894</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV023521829</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</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">XA-DE-NI</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-521</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 130</subfield><subfield code="0">(DE-625)143216:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 304</subfield><subfield code="0">(DE-625)143653:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">28</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Plaisted, David A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The efficiency of theorem proving strategies</subfield><subfield code="b">a comparative and asymptotic analysis</subfield><subfield code="c">David A. Plaisted ; Yunshan Zhu</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2., rev. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Braunschweig ; Wiesbaden</subfield><subfield code="b">Vieweg</subfield><subfield code="c">1999</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VIII, 170 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">21 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">Computational intelligence</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 157 - 163</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="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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhu, Yunshan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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=016842121&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016842121</subfield></datafield></record></collection> |
id | DE-604.BV023521829 |
illustrated | Illustrated |
index_date | 2024-07-02T22:33:02Z |
indexdate | 2024-07-09T21:23:49Z |
institution | BVB |
isbn | 3528155744 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016842121 |
oclc_num | 264400894 |
open_access_boolean | |
owner | DE-521 DE-634 DE-11 |
owner_facet | DE-521 DE-634 DE-11 |
physical | VIII, 170 S. graph. Darst. 21 cm |
publishDate | 1999 |
publishDateSearch | 1999 |
publishDateSort | 1999 |
publisher | Vieweg |
record_format | marc |
series2 | Computational intelligence |
spelling | Plaisted, David A. Verfasser aut The efficiency of theorem proving strategies a comparative and asymptotic analysis David A. Plaisted ; Yunshan Zhu 2., rev. ed. Braunschweig ; Wiesbaden Vieweg 1999 VIII, 170 S. graph. Darst. 21 cm txt rdacontent n rdamedia nc rdacarrier Computational intelligence Literaturverz. S. 157 - 163 Automatisches Beweisverfahren (DE-588)4069034-9 gnd rswk-swf Automatisches Beweisverfahren (DE-588)4069034-9 s DE-604 Zhu, Yunshan Verfasser aut DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016842121&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Plaisted, David A. Zhu, Yunshan The efficiency of theorem proving strategies a comparative and asymptotic analysis Automatisches Beweisverfahren (DE-588)4069034-9 gnd |
subject_GND | (DE-588)4069034-9 |
title | The efficiency of theorem proving strategies a comparative and asymptotic analysis |
title_auth | The efficiency of theorem proving strategies a comparative and asymptotic analysis |
title_exact_search | The efficiency of theorem proving strategies a comparative and asymptotic analysis |
title_exact_search_txtP | The efficiency of theorem proving strategies a comparative and asymptotic analysis |
title_full | The efficiency of theorem proving strategies a comparative and asymptotic analysis David A. Plaisted ; Yunshan Zhu |
title_fullStr | The efficiency of theorem proving strategies a comparative and asymptotic analysis David A. Plaisted ; Yunshan Zhu |
title_full_unstemmed | The efficiency of theorem proving strategies a comparative and asymptotic analysis David A. Plaisted ; Yunshan Zhu |
title_short | The efficiency of theorem proving strategies |
title_sort | the efficiency of theorem proving strategies a comparative and asymptotic analysis |
title_sub | a comparative and asymptotic analysis |
topic | Automatisches Beweisverfahren (DE-588)4069034-9 gnd |
topic_facet | Automatisches Beweisverfahren |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016842121&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
work_keys_str_mv | AT plaisteddavida theefficiencyoftheoremprovingstrategiesacomparativeandasymptoticanalysis AT zhuyunshan theefficiencyoftheoremprovingstrategiesacomparativeandasymptoticanalysis |