A procedural semantics for well founded negation in logic programs:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Stanford, Calif.
1988
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN-CS
1233 |
| Umfang: | 29 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009241051 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 940313s1988 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)257826546 | ||
| 035 | |a (DE-599)BVBBV009241051 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-91G | ||
| 100 | 1 | |a Ross, Kenneth A. |d 1936- |e Verfasser |0 (DE-588)107448998 |4 aut | |
| 245 | 1 | 0 | |a A procedural semantics for well founded negation in logic programs |
| 264 | 1 | |a Stanford, Calif. |c 1988 | |
| 300 | |a 29 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN-CS |v 1233 | |
| 810 | 2 | |a Computer Science Department: Report STAN-CS |t Stanford University |v 1233 |w (DE-604)BV008928280 |9 1233 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006147886 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0111 2001 B 6115-1233 |
|---|---|
| DE-BY-TUM_katkey | 1691122 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040010282316 |
| _version_ | 1821933666974040065 |
| any_adam_object | |
| author | Ross, Kenneth A. 1936- |
| author_GND | (DE-588)107448998 |
| author_facet | Ross, Kenneth A. 1936- |
| author_role | aut |
| author_sort | Ross, Kenneth A. 1936- |
| author_variant | k a r ka kar |
| building | Verbundindex |
| bvnumber | BV009241051 |
| ctrlnum | (OCoLC)257826546 (DE-599)BVBBV009241051 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00894nam a2200265 cb4500</leader><controlfield tag="001">BV009241051</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940313s1988 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)257826546</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009241051</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-29T</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ross, Kenneth A.</subfield><subfield code="d">1936-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)107448998</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A procedural semantics for well founded negation in logic programs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1988</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">29 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">Stanford University / Computer Science Department: Report STAN-CS</subfield><subfield code="v">1233</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN-CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1233</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1233</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006147886</subfield></datafield></record></collection> |
| id | DE-604.BV009241051 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:34:54Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006147886 |
| oclc_num | 257826546 |
| open_access_boolean | |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 29 S. |
| publishDate | 1988 |
| publishDateSearch | 1988 |
| publishDateSort | 1988 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN-CS |
| spellingShingle | Ross, Kenneth A. 1936- A procedural semantics for well founded negation in logic programs |
| title | A procedural semantics for well founded negation in logic programs |
| title_auth | A procedural semantics for well founded negation in logic programs |
| title_exact_search | A procedural semantics for well founded negation in logic programs |
| title_full | A procedural semantics for well founded negation in logic programs |
| title_fullStr | A procedural semantics for well founded negation in logic programs |
| title_full_unstemmed | A procedural semantics for well founded negation in logic programs |
| title_short | A procedural semantics for well founded negation in logic programs |
| title_sort | a procedural semantics for well founded negation in logic programs |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT rosskennetha aproceduralsemanticsforwellfoundednegationinlogicprograms |
Paper/Kapitel scannen lassen
Teilbibliothek Mathematik & Informatik, Berichte
| Signatur: |
0111 2001 B 6115-1233
Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |