Graph-based proof procedures for horn clauses:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Abschlussarbeit Buch |
Sprache: | English |
Veröffentlicht: |
Boston [u.a.]
Birkhäuser
1990
|
Schriftenreihe: | Progress in computer science and applied logic
10 |
Schlagworte: | |
Beschreibung: | 147 S. |
ISBN: | 0817635300 3764335300 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV004238809 | ||
003 | DE-604 | ||
005 | 20100809 | ||
007 | t | ||
008 | 910218s1990 m||| 00||| engod | ||
020 | |a 0817635300 |9 0-8176-3530-0 | ||
020 | |a 3764335300 |9 3-7643-3530-0 | ||
035 | |a (OCoLC)22906207 | ||
035 | |a (DE-599)BVBBV004238809 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-12 |a DE-91G |a DE-384 |a DE-473 |a DE-739 |a DE-20 |a DE-29T |a DE-19 |a DE-83 |a DE-11 |a DE-188 | ||
050 | 0 | |a QA76.63 | |
082 | 0 | |a 005.1 |2 20 | |
084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
084 | |a DAT 706f |2 stub | ||
100 | 1 | |a Raatz, Stan |e Verfasser |4 aut | |
245 | 1 | 0 | |a Graph-based proof procedures for horn clauses |c Stan Raatz |
264 | 1 | |a Boston [u.a.] |b Birkhäuser |c 1990 | |
300 | |a 147 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Progress in computer science and applied logic |v 10 | |
502 | |a Zugl.: Univ. of Pennsylvania, Diss., 1987 | ||
650 | 4 | |a Graph theory | |
650 | 4 | |a Horn clauses | |
650 | 4 | |a Logic programming | |
650 | 0 | 7 | |a Graphentheoretisches Modell |0 (DE-588)4158055-2 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Programmierung |0 (DE-588)4076370-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Horn-Klausel |0 (DE-588)4202453-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Horn-Formel |0 (DE-588)4160675-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Beweis |0 (DE-588)4132532-1 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
689 | 0 | 0 | |a Horn-Formel |0 (DE-588)4160675-9 |D s |
689 | 0 | 1 | |a Programmierung |0 (DE-588)4076370-5 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Horn-Klausel |0 (DE-588)4202453-5 |D s |
689 | 1 | 1 | |a Graphentheoretisches Modell |0 (DE-588)4158055-2 |D s |
689 | 1 | |5 DE-604 | |
689 | 2 | 0 | |a Horn-Klausel |0 (DE-588)4202453-5 |D s |
689 | 2 | |5 DE-604 | |
689 | 3 | 0 | |a Horn-Klausel |0 (DE-588)4202453-5 |D s |
689 | 3 | 1 | |a Beweis |0 (DE-588)4132532-1 |D s |
689 | 3 | |5 DE-604 | |
830 | 0 | |a Progress in computer science and applied logic |v 10 |w (DE-604)BV004157568 |9 10 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-002637004 |
Datensatz im Suchindex
_version_ | 1804118434721562624 |
---|---|
any_adam_object | |
author | Raatz, Stan |
author_facet | Raatz, Stan |
author_role | aut |
author_sort | Raatz, Stan |
author_variant | s r sr |
building | Verbundindex |
bvnumber | BV004238809 |
callnumber-first | Q - Science |
callnumber-label | QA76 |
callnumber-raw | QA76.63 |
callnumber-search | QA76.63 |
callnumber-sort | QA 276.63 |
callnumber-subject | QA - Mathematics |
classification_rvk | SK 130 ST 130 |
classification_tum | DAT 706f |
ctrlnum | (OCoLC)22906207 (DE-599)BVBBV004238809 |
dewey-full | 005.1 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 005 - Computer programming, programs, data, security |
dewey-raw | 005.1 |
dewey-search | 005.1 |
dewey-sort | 15.1 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik Mathematik |
format | Thesis Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02137nam a2200601 cb4500</leader><controlfield tag="001">BV004238809</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20100809 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">910218s1990 m||| 00||| engod</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0817635300</subfield><subfield code="9">0-8176-3530-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3764335300</subfield><subfield code="9">3-7643-3530-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22906207</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV004238809</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="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.63</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">20</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 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 706f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Raatz, Stan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graph-based proof procedures for horn clauses</subfield><subfield code="c">Stan Raatz</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston [u.a.]</subfield><subfield code="b">Birkhäuser</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">147 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="490" ind1="1" ind2=" "><subfield code="a">Progress in computer science and applied logic</subfield><subfield code="v">10</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Univ. of Pennsylvania, Diss., 1987</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Horn clauses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheoretisches Modell</subfield><subfield code="0">(DE-588)4158055-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Horn-Klausel</subfield><subfield code="0">(DE-588)4202453-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Horn-Formel</subfield><subfield code="0">(DE-588)4160675-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Beweis</subfield><subfield code="0">(DE-588)4132532-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">Horn-Formel</subfield><subfield code="0">(DE-588)4160675-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</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">Horn-Klausel</subfield><subfield code="0">(DE-588)4202453-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Graphentheoretisches Modell</subfield><subfield code="0">(DE-588)4158055-2</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">Horn-Klausel</subfield><subfield code="0">(DE-588)4202453-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Horn-Klausel</subfield><subfield code="0">(DE-588)4202453-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="1"><subfield code="a">Beweis</subfield><subfield code="0">(DE-588)4132532-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Progress in computer science and applied logic</subfield><subfield code="v">10</subfield><subfield code="w">(DE-604)BV004157568</subfield><subfield code="9">10</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002637004</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV004238809 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T16:10:14Z |
institution | BVB |
isbn | 0817635300 3764335300 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002637004 |
oclc_num | 22906207 |
open_access_boolean | |
owner | DE-12 DE-91G DE-BY-TUM DE-384 DE-473 DE-BY-UBG DE-739 DE-20 DE-29T DE-19 DE-BY-UBM DE-83 DE-11 DE-188 |
owner_facet | DE-12 DE-91G DE-BY-TUM DE-384 DE-473 DE-BY-UBG DE-739 DE-20 DE-29T DE-19 DE-BY-UBM DE-83 DE-11 DE-188 |
physical | 147 S. |
publishDate | 1990 |
publishDateSearch | 1990 |
publishDateSort | 1990 |
publisher | Birkhäuser |
record_format | marc |
series | Progress in computer science and applied logic |
series2 | Progress in computer science and applied logic |
spelling | Raatz, Stan Verfasser aut Graph-based proof procedures for horn clauses Stan Raatz Boston [u.a.] Birkhäuser 1990 147 S. txt rdacontent n rdamedia nc rdacarrier Progress in computer science and applied logic 10 Zugl.: Univ. of Pennsylvania, Diss., 1987 Graph theory Horn clauses Logic programming Graphentheoretisches Modell (DE-588)4158055-2 gnd rswk-swf Programmierung (DE-588)4076370-5 gnd rswk-swf Horn-Klausel (DE-588)4202453-5 gnd rswk-swf Horn-Formel (DE-588)4160675-9 gnd rswk-swf Beweis (DE-588)4132532-1 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Horn-Formel (DE-588)4160675-9 s Programmierung (DE-588)4076370-5 s DE-604 Horn-Klausel (DE-588)4202453-5 s Graphentheoretisches Modell (DE-588)4158055-2 s Beweis (DE-588)4132532-1 s Progress in computer science and applied logic 10 (DE-604)BV004157568 10 |
spellingShingle | Raatz, Stan Graph-based proof procedures for horn clauses Progress in computer science and applied logic Graph theory Horn clauses Logic programming Graphentheoretisches Modell (DE-588)4158055-2 gnd Programmierung (DE-588)4076370-5 gnd Horn-Klausel (DE-588)4202453-5 gnd Horn-Formel (DE-588)4160675-9 gnd Beweis (DE-588)4132532-1 gnd |
subject_GND | (DE-588)4158055-2 (DE-588)4076370-5 (DE-588)4202453-5 (DE-588)4160675-9 (DE-588)4132532-1 (DE-588)4113937-9 |
title | Graph-based proof procedures for horn clauses |
title_auth | Graph-based proof procedures for horn clauses |
title_exact_search | Graph-based proof procedures for horn clauses |
title_full | Graph-based proof procedures for horn clauses Stan Raatz |
title_fullStr | Graph-based proof procedures for horn clauses Stan Raatz |
title_full_unstemmed | Graph-based proof procedures for horn clauses Stan Raatz |
title_short | Graph-based proof procedures for horn clauses |
title_sort | graph based proof procedures for horn clauses |
topic | Graph theory Horn clauses Logic programming Graphentheoretisches Modell (DE-588)4158055-2 gnd Programmierung (DE-588)4076370-5 gnd Horn-Klausel (DE-588)4202453-5 gnd Horn-Formel (DE-588)4160675-9 gnd Beweis (DE-588)4132532-1 gnd |
topic_facet | Graph theory Horn clauses Logic programming Graphentheoretisches Modell Programmierung Horn-Klausel Horn-Formel Beweis Hochschulschrift |
volume_link | (DE-604)BV004157568 |
work_keys_str_mv | AT raatzstan graphbasedproofproceduresforhornclauses |