Completeness and soundness of the connection graph proof procedure:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
Karlsruhe
1976
|
| Schriftenreihe: | Universität <Karlsruhe> / Fakultät für Informatik: Interner Bericht
76,7 |
| Schlagworte: | |
| Beschreibung: | 31 Bl. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009800587 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940912s1976 d||| m||| 00||| undod | ||
| 035 | |a (OCoLC)633572223 | ||
| 035 | |a (DE-599)BVBBV009800587 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 049 | |a DE-91G | ||
| 100 | 1 | |a Stephan, W. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Completeness and soundness of the connection graph proof procedure |c W. Stephan ; J. Siekmann |
| 264 | 1 | |a Karlsruhe |c 1976 | |
| 300 | |a 31 Bl. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Universität <Karlsruhe> / Fakultät für Informatik: Interner Bericht |v 76,7 | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 700 | 1 | |a Siekmann, Jörg H. |e Verfasser |4 aut | |
| 810 | 2 | |a Fakultät für Informatik: Interner Bericht |t Universität <Karlsruhe> |v 76,7 |w (DE-604)BV000003275 |9 76,7 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006484631 | ||
Datensatz im Suchindex
| _version_ | 1804124150153871360 |
|---|---|
| any_adam_object | |
| author | Stephan, W. Siekmann, Jörg H. |
| author_facet | Stephan, W. Siekmann, Jörg H. |
| author_role | aut aut |
| author_sort | Stephan, W. |
| author_variant | w s ws j h s jh jhs |
| building | Verbundindex |
| bvnumber | BV009800587 |
| ctrlnum | (OCoLC)633572223 (DE-599)BVBBV009800587 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01011nam a2200289 cb4500</leader><controlfield tag="001">BV009800587</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940912s1976 d||| m||| 00||| undod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)633572223</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009800587</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=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Stephan, W.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Completeness and soundness of the connection graph proof procedure</subfield><subfield code="c">W. Stephan ; J. Siekmann</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Karlsruhe</subfield><subfield code="c">1976</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">31 Bl.</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">Universität <Karlsruhe> / Fakultät für Informatik: Interner Bericht</subfield><subfield code="v">76,7</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="700" ind1="1" ind2=" "><subfield code="a">Siekmann, Jörg H.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Fakultät für Informatik: Interner Bericht</subfield><subfield code="t">Universität <Karlsruhe></subfield><subfield code="v">76,7</subfield><subfield code="w">(DE-604)BV000003275</subfield><subfield code="9">76,7</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006484631</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV009800587 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:41:05Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006484631 |
| oclc_num | 633572223 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 31 Bl. graph. Darst. |
| publishDate | 1976 |
| publishDateSearch | 1976 |
| publishDateSort | 1976 |
| record_format | marc |
| series2 | Universität <Karlsruhe> / Fakultät für Informatik: Interner Bericht |
| spelling | Stephan, W. Verfasser aut Completeness and soundness of the connection graph proof procedure W. Stephan ; J. Siekmann Karlsruhe 1976 31 Bl. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Universität <Karlsruhe> / Fakultät für Informatik: Interner Bericht 76,7 (DE-588)4113937-9 Hochschulschrift gnd-content Siekmann, Jörg H. Verfasser aut Fakultät für Informatik: Interner Bericht Universität <Karlsruhe> 76,7 (DE-604)BV000003275 76,7 |
| spellingShingle | Stephan, W. Siekmann, Jörg H. Completeness and soundness of the connection graph proof procedure |
| subject_GND | (DE-588)4113937-9 |
| title | Completeness and soundness of the connection graph proof procedure |
| title_auth | Completeness and soundness of the connection graph proof procedure |
| title_exact_search | Completeness and soundness of the connection graph proof procedure |
| title_full | Completeness and soundness of the connection graph proof procedure W. Stephan ; J. Siekmann |
| title_fullStr | Completeness and soundness of the connection graph proof procedure W. Stephan ; J. Siekmann |
| title_full_unstemmed | Completeness and soundness of the connection graph proof procedure W. Stephan ; J. Siekmann |
| title_short | Completeness and soundness of the connection graph proof procedure |
| title_sort | completeness and soundness of the connection graph proof procedure |
| topic_facet | Hochschulschrift |
| volume_link | (DE-604)BV000003275 |
| work_keys_str_mv | AT stephanw completenessandsoundnessoftheconnectiongraphproofprocedure AT siekmannjorgh completenessandsoundnessoftheconnectiongraphproofprocedure |