CAL, a theoretical background of constraint logic programming and its applications:
Abstract: "Constraint logic programming (CLP) is an extension of logic programming by introducing the facility of writing and solving constraints in a certain domain. CAL (Contrainte avec Logique) is a CLP language in which (possibly non-linear) polynomial equations can be written as constraint...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Tokyo, Japan
1990
|
| Edition: | (Rev.) |
| Series: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
537 |
| Subjects: | |
| Summary: | Abstract: "Constraint logic programming (CLP) is an extension of logic programming by introducing the facility of writing and solving constraints in a certain domain. CAL (Contrainte avec Logique) is a CLP language in which (possibly non-linear) polynomial equations can be written as constraints, while almost all the other CLP languages proposed so far have concentrated only on linear equations and inequations. This paper describes a general semantics of CLP including CAL, and shows the validity of CAL in this framework." |
| Physical Description: | 14 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010949040 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960913s1990 |||| 00||| engod | ||
| 035 | |a (OCoLC)22536641 | ||
| 035 | |a (DE-599)BVBBV010949040 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Sakai, Ko |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a CAL, a theoretical background of constraint logic programming and its applications |c by K. Sakai & A. Aiba |
| 250 | |a (Rev.) | ||
| 264 | 1 | |a Tokyo, Japan |c 1990 | |
| 300 | |a 14 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 537 | |
| 520 | 3 | |a Abstract: "Constraint logic programming (CLP) is an extension of logic programming by introducing the facility of writing and solving constraints in a certain domain. CAL (Contrainte avec Logique) is a CLP language in which (possibly non-linear) polynomial equations can be written as constraints, while almost all the other CLP languages proposed so far have concentrated only on linear equations and inequations. This paper describes a general semantics of CLP including CAL, and shows the validity of CAL in this framework." | |
| 650 | 4 | |a Logic programming | |
| 700 | 1 | |a Aiba, Akira |e Verfasser |4 aut | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 537 |w (DE-604)BV010923438 |9 537 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007322994 | ||
Record in the Search Index
| _version_ | 1804125435970191360 |
|---|---|
| any_adam_object | |
| author | Sakai, Ko Aiba, Akira |
| author_facet | Sakai, Ko Aiba, Akira |
| author_role | aut aut |
| author_sort | Sakai, Ko |
| author_variant | k s ks a a aa |
| building | Verbundindex |
| bvnumber | BV010949040 |
| ctrlnum | (OCoLC)22536641 (DE-599)BVBBV010949040 |
| edition | (Rev.) |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01547nam a2200313 cb4500</leader><controlfield tag="001">BV010949040</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960913s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22536641</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010949040</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-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sakai, Ko</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">CAL, a theoretical background of constraint logic programming and its applications</subfield><subfield code="c">by K. Sakai & A. Aiba</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">(Rev.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1990</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">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">537</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Constraint logic programming (CLP) is an extension of logic programming by introducing the facility of writing and solving constraints in a certain domain. CAL (Contrainte avec Logique) is a CLP language in which (possibly non-linear) polynomial equations can be written as constraints, while almost all the other CLP languages proposed so far have concentrated only on linear equations and inequations. This paper describes a general semantics of CLP including CAL, and shows the validity of CAL in this framework."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Aiba, Akira</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">537</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">537</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007322994</subfield></datafield></record></collection> |
| id | DE-604.BV010949040 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:31Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007322994 |
| oclc_num | 22536641 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 14 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| series2 | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| spelling | Sakai, Ko Verfasser aut CAL, a theoretical background of constraint logic programming and its applications by K. Sakai & A. Aiba (Rev.) Tokyo, Japan 1990 14 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 537 Abstract: "Constraint logic programming (CLP) is an extension of logic programming by introducing the facility of writing and solving constraints in a certain domain. CAL (Contrainte avec Logique) is a CLP language in which (possibly non-linear) polynomial equations can be written as constraints, while almost all the other CLP languages proposed so far have concentrated only on linear equations and inequations. This paper describes a general semantics of CLP including CAL, and shows the validity of CAL in this framework." Logic programming Aiba, Akira Verfasser aut Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 537 (DE-604)BV010923438 537 |
| spellingShingle | Sakai, Ko Aiba, Akira CAL, a theoretical background of constraint logic programming and its applications Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Logic programming |
| title | CAL, a theoretical background of constraint logic programming and its applications |
| title_auth | CAL, a theoretical background of constraint logic programming and its applications |
| title_exact_search | CAL, a theoretical background of constraint logic programming and its applications |
| title_full | CAL, a theoretical background of constraint logic programming and its applications by K. Sakai & A. Aiba |
| title_fullStr | CAL, a theoretical background of constraint logic programming and its applications by K. Sakai & A. Aiba |
| title_full_unstemmed | CAL, a theoretical background of constraint logic programming and its applications by K. Sakai & A. Aiba |
| title_short | CAL, a theoretical background of constraint logic programming and its applications |
| title_sort | cal a theoretical background of constraint logic programming and its applications |
| topic | Logic programming |
| topic_facet | Logic programming |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT sakaiko calatheoreticalbackgroundofconstraintlogicprogramminganditsapplications AT aibaakira calatheoreticalbackgroundofconstraintlogicprogramminganditsapplications |