Temporal logic programming is complete and expressive:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Stanford, Calif.
1988
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN-CS
1232 |
| Schlagworte: | |
| Beschreibung: | 14 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009241072 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940313s1988 |||| 00||| eng d | ||
| 035 | |a (OCoLC)19349336 | ||
| 035 | |a (DE-599)BVBBV009241072 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 050 | 0 | |a QA76 | |
| 100 | 1 | |a Baudinet, Marianne |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Temporal logic programming is complete and expressive |
| 264 | 1 | |a Stanford, Calif. |c 1988 | |
| 300 | |a 14 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 1232 | |
| 650 | 4 | |a Logic programming | |
| 650 | 4 | |a Programming languages (Electronic computers) |x Semantics | |
| 810 | 2 | |a Computer Science Department: Report STAN-CS |t Stanford University |v 1232 |w (DE-604)BV008928280 |9 1232 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006147907 | ||
Datensatz im Suchindex
| _version_ | 1804123687247413248 |
|---|---|
| any_adam_object | |
| author | Baudinet, Marianne |
| author_facet | Baudinet, Marianne |
| author_role | aut |
| author_sort | Baudinet, Marianne |
| author_variant | m b mb |
| building | Verbundindex |
| bvnumber | BV009241072 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76 |
| callnumber-search | QA76 |
| callnumber-sort | QA 276 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)19349336 (DE-599)BVBBV009241072 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00970nam a2200301 cb4500</leader><controlfield tag="001">BV009241072</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1988 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)19349336</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009241072</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></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Baudinet, Marianne</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Temporal logic programming is complete and expressive</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">14 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">1232</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming languages (Electronic computers)</subfield><subfield code="x">Semantics</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">1232</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1232</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006147907</subfield></datafield></record></collection> |
| id | DE-604.BV009241072 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:33:44Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006147907 |
| oclc_num | 19349336 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 14 S. |
| publishDate | 1988 |
| publishDateSearch | 1988 |
| publishDateSort | 1988 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN-CS |
| spelling | Baudinet, Marianne Verfasser aut Temporal logic programming is complete and expressive Stanford, Calif. 1988 14 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN-CS 1232 Logic programming Programming languages (Electronic computers) Semantics Computer Science Department: Report STAN-CS Stanford University 1232 (DE-604)BV008928280 1232 |
| spellingShingle | Baudinet, Marianne Temporal logic programming is complete and expressive Logic programming Programming languages (Electronic computers) Semantics |
| title | Temporal logic programming is complete and expressive |
| title_auth | Temporal logic programming is complete and expressive |
| title_exact_search | Temporal logic programming is complete and expressive |
| title_full | Temporal logic programming is complete and expressive |
| title_fullStr | Temporal logic programming is complete and expressive |
| title_full_unstemmed | Temporal logic programming is complete and expressive |
| title_short | Temporal logic programming is complete and expressive |
| title_sort | temporal logic programming is complete and expressive |
| topic | Logic programming Programming languages (Electronic computers) Semantics |
| topic_facet | Logic programming Programming languages (Electronic computers) Semantics |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT baudinetmarianne temporallogicprogrammingiscompleteandexpressive |