The action as implication paradigm: formal systems and application
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | German |
Veröffentlicht: |
München
CS Press
1996
|
Schriftenreihe: | Computer science monographs
1 |
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | Zugl.: München, Techn. Univ., Habil.-Schr., 1996 |
Beschreibung: | 293 S. graph. Darst. |
ISBN: | 3931757919 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV011061510 | ||
003 | DE-604 | ||
005 | 20050913 | ||
007 | t | ||
008 | 961105s1996 gw d||| m||| 00||| ger d | ||
016 | 7 | |a 948946636 |2 DE-101 | |
020 | |a 3931757919 |c brosch. : DM 99.50 (freier Pr.), S 698.00 |9 3-931757-91-9 | ||
035 | |a (OCoLC)37813688 | ||
035 | |a (DE-599)BVBBV011061510 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a ger | |
044 | |a gw |c DE | ||
049 | |a DE-12 |a DE-91 | ||
050 | 0 | |a QA76.9.A96 | |
084 | |a DAT 706d |2 stub | ||
084 | |a DAT 540d |2 stub | ||
084 | |a DAT 510d |2 stub | ||
100 | 1 | |a Fronhöfer, Bertram |e Verfasser |4 aut | |
245 | 1 | 0 | |a The action as implication paradigm |b formal systems and application |c Bertram Fronhöfer |
246 | 1 | 3 | |a The action-as-implication paradigm |
264 | 1 | |a München |b CS Press |c 1996 | |
300 | |a 293 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Computer science monographs |v 1 | |
500 | |a Zugl.: München, Techn. Univ., Habil.-Schr., 1996 | ||
650 | 4 | |a Automatic theorem proving | |
650 | 4 | |a Computer logic | |
650 | 0 | 7 | |a Konnektionsmethode |0 (DE-588)4389325-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Operation |g Mathematik |0 (DE-588)4115450-2 |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 Einschluss |0 (DE-588)4013926-8 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Automatische Handlungsplanung |0 (DE-588)4211191-2 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Handlungslogik |0 (DE-588)4140940-1 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
689 | 0 | 0 | |a Handlungslogik |0 (DE-588)4140940-1 |D s |
689 | 0 | 1 | |a Automatisches Beweisverfahren |0 (DE-588)4069034-9 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Operation |g Mathematik |0 (DE-588)4115450-2 |D s |
689 | 1 | 1 | |a Einschluss |0 (DE-588)4013926-8 |D s |
689 | 1 | |5 DE-604 | |
689 | 2 | 0 | |a Automatische Handlungsplanung |0 (DE-588)4211191-2 |D s |
689 | 2 | 1 | |a Konnektionsmethode |0 (DE-588)4389325-9 |D s |
689 | 2 | |5 DE-604 | |
830 | 0 | |a Computer science monographs |v 1 |w (DE-604)BV011278358 |9 1 | |
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=007408470&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007408470 |
Datensatz im Suchindex
_version_ | 1807501860386373632 |
---|---|
adam_text |
CONTENTS
1
INTRODUCTION
3
1.1
ACTION
AND
INFERENCE
.
3
1.2
LINEAR
CONNECTION
PROOFS
.
5
1.3
RATIONALE
OF
INVESTIGATION
&
OVERVIEW
.
7
1.4
HISTORICAL
REMARKS
.
12
APPENDIX:
THE
CONNECTION
METHOD
.
16
2
ANALYSIS
OF
PHENOMENA
25
2.1
FUNDAMENTAL
CONCEPTS
.
25
2.1.1
OCCURRENCES
.
25
*
2.1.2
LOGICAL
LANGUAGES
.
'.
.
28
2.1.3
SEQUENT
SYSTEMS
.
31
2.1.4
SUBFORMULA
JOIN-LATTICES
.
38
2.1.5
AXIOMATICS
.
46
2.2
MULTICONNECTED
LITERALS
AND
CONTRACTION
47
3
MATRIX
CONCEPTS
56
3.1
MATRIX
THEORIES
.
57
3.2
MATRICES
.
62
3.2.1
FLATTENING
.
68
3.2.2
RECTANGLES
.
74
3.2.3
MATRIX
JOIN-LATTICES
.
78
3.3
TRANSLATIONS
.
80
3.3.1
CANONICAL
MAPPING
.
82
3.3.2
FINE-GRAINED
TRANSLATION
.
86
3.3.3
FORMULA
CONSTRUCTION
.
97
3.4
MATRIX
GRAPHS
.
103
3.4.1
CONNECTIONS
.
103
3.4.2
CONNECTION
CHAINS
.
108
3.4.3
COVER
AREA
.
116
4
CONTRACTION-FREE
MULTIPLICATIVE
LOGICS
125
4.1
CORRECTNESS
.
130
4.2
LINEAR
CYCLE-FREE
MATRICES
.
142
4.2.1
KNOTS
.
144
4.2.2
CLOSED
CHAINS
.
152
4.2.3
SPLITTING
MATRICES
.
171
4.3
COMPLETENESS
.
176
5
THE
CUT
RULE
190
5.1
REPRESENTATION
OF
CUTS
.
190
5.2
CUT
ELIMINATION
.
197
6
ACYCLICITY
206
6.1
THE
H
ORN
FRAGMENT
.
206
6.2
LINEAR
HORN
MATRICES
.
215
6.3
NEGATIVELY
LINEAR
HORN
MATRICES
.
218
6.4
CYCLIC
LINEAR
MATRIX
GRAPHS
.
220
7
MULTI-LINEAR
MATRICES
224
7.1
REPRESENTATION
OF
CONTRACTION
.
225
7.2
HORIZONTAL
COPYING
.
229
7.3
MULTI-C-LINEAR
HORN-MATRICES
.
248
8
PLAN
GENERATION
253
8.1
THE
SEMANTICS
OF
PLANNING
.
253
8.2
RELATED
PLANNING
FORMALISMS
.
261
8.3
LINEAR
BACKWARD
CHAINING
.
268
BIBLIOGRAPHY
-
279
INDEX
286 |
any_adam_object | 1 |
author | Fronhöfer, Bertram |
author_facet | Fronhöfer, Bertram |
author_role | aut |
author_sort | Fronhöfer, Bertram |
author_variant | b f bf |
building | Verbundindex |
bvnumber | BV011061510 |
callnumber-first | Q - Science |
callnumber-label | QA76 |
callnumber-raw | QA76.9.A96 |
callnumber-search | QA76.9.A96 |
callnumber-sort | QA 276.9 A96 |
callnumber-subject | QA - Mathematics |
classification_tum | DAT 706d DAT 540d DAT 510d |
ctrlnum | (OCoLC)37813688 (DE-599)BVBBV011061510 |
discipline | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV011061510</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20050913</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961105s1996 gw d||| m||| 00||| ger d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">948946636</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3931757919</subfield><subfield code="c">brosch. : DM 99.50 (freier Pr.), S 698.00</subfield><subfield code="9">3-931757-91-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)37813688</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011061510</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">ger</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-12</subfield><subfield code="a">DE-91</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.A96</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 706d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 540d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 510d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Fronhöfer, Bertram</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The action as implication paradigm</subfield><subfield code="b">formal systems and application</subfield><subfield code="c">Bertram Fronhöfer</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">The action-as-implication paradigm</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="b">CS Press</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">293 S.</subfield><subfield code="b">graph. Darst.</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="1" ind2=" "><subfield code="a">Computer science monographs</subfield><subfield code="v">1</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: München, Techn. Univ., Habil.-Schr., 1996</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic theorem proving</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer logic</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Konnektionsmethode</subfield><subfield code="0">(DE-588)4389325-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Operation</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4115450-2</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">Einschluss</subfield><subfield code="0">(DE-588)4013926-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Automatische Handlungsplanung</subfield><subfield code="0">(DE-588)4211191-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Handlungslogik</subfield><subfield code="0">(DE-588)4140940-1</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">Handlungslogik</subfield><subfield code="0">(DE-588)4140940-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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="689" ind1="1" ind2="0"><subfield code="a">Operation</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4115450-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Einschluss</subfield><subfield code="0">(DE-588)4013926-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Automatische Handlungsplanung</subfield><subfield code="0">(DE-588)4211191-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Konnektionsmethode</subfield><subfield code="0">(DE-588)4389325-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Computer science monographs</subfield><subfield code="v">1</subfield><subfield code="w">(DE-604)BV011278358</subfield><subfield code="9">1</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=007408470&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-007408470</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV011061510 |
illustrated | Illustrated |
indexdate | 2024-08-16T00:28:20Z |
institution | BVB |
isbn | 3931757919 |
language | German |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007408470 |
oclc_num | 37813688 |
open_access_boolean | |
owner | DE-12 DE-91 DE-BY-TUM |
owner_facet | DE-12 DE-91 DE-BY-TUM |
physical | 293 S. graph. Darst. |
publishDate | 1996 |
publishDateSearch | 1996 |
publishDateSort | 1996 |
publisher | CS Press |
record_format | marc |
series | Computer science monographs |
series2 | Computer science monographs |
spelling | Fronhöfer, Bertram Verfasser aut The action as implication paradigm formal systems and application Bertram Fronhöfer The action-as-implication paradigm München CS Press 1996 293 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Computer science monographs 1 Zugl.: München, Techn. Univ., Habil.-Schr., 1996 Automatic theorem proving Computer logic Konnektionsmethode (DE-588)4389325-9 gnd rswk-swf Operation Mathematik (DE-588)4115450-2 gnd rswk-swf Automatisches Beweisverfahren (DE-588)4069034-9 gnd rswk-swf Einschluss (DE-588)4013926-8 gnd rswk-swf Automatische Handlungsplanung (DE-588)4211191-2 gnd rswk-swf Handlungslogik (DE-588)4140940-1 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Handlungslogik (DE-588)4140940-1 s Automatisches Beweisverfahren (DE-588)4069034-9 s DE-604 Operation Mathematik (DE-588)4115450-2 s Einschluss (DE-588)4013926-8 s Automatische Handlungsplanung (DE-588)4211191-2 s Konnektionsmethode (DE-588)4389325-9 s Computer science monographs 1 (DE-604)BV011278358 1 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007408470&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Fronhöfer, Bertram The action as implication paradigm formal systems and application Computer science monographs Automatic theorem proving Computer logic Konnektionsmethode (DE-588)4389325-9 gnd Operation Mathematik (DE-588)4115450-2 gnd Automatisches Beweisverfahren (DE-588)4069034-9 gnd Einschluss (DE-588)4013926-8 gnd Automatische Handlungsplanung (DE-588)4211191-2 gnd Handlungslogik (DE-588)4140940-1 gnd |
subject_GND | (DE-588)4389325-9 (DE-588)4115450-2 (DE-588)4069034-9 (DE-588)4013926-8 (DE-588)4211191-2 (DE-588)4140940-1 (DE-588)4113937-9 |
title | The action as implication paradigm formal systems and application |
title_alt | The action-as-implication paradigm |
title_auth | The action as implication paradigm formal systems and application |
title_exact_search | The action as implication paradigm formal systems and application |
title_full | The action as implication paradigm formal systems and application Bertram Fronhöfer |
title_fullStr | The action as implication paradigm formal systems and application Bertram Fronhöfer |
title_full_unstemmed | The action as implication paradigm formal systems and application Bertram Fronhöfer |
title_short | The action as implication paradigm |
title_sort | the action as implication paradigm formal systems and application |
title_sub | formal systems and application |
topic | Automatic theorem proving Computer logic Konnektionsmethode (DE-588)4389325-9 gnd Operation Mathematik (DE-588)4115450-2 gnd Automatisches Beweisverfahren (DE-588)4069034-9 gnd Einschluss (DE-588)4013926-8 gnd Automatische Handlungsplanung (DE-588)4211191-2 gnd Handlungslogik (DE-588)4140940-1 gnd |
topic_facet | Automatic theorem proving Computer logic Konnektionsmethode Operation Mathematik Automatisches Beweisverfahren Einschluss Automatische Handlungsplanung Handlungslogik Hochschulschrift |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007408470&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV011278358 |
work_keys_str_mv | AT fronhoferbertram theactionasimplicationparadigmformalsystemsandapplication AT fronhoferbertram theactionasimplicationparadigm |