Solving constraints over sets by Boolean Gröbner bases:
Abstract: "Any constraint over sets can be represented in terms of a Boolean polynomial ring whenever the family of sets that we consider forms a Boolean ring. In this paper we give a complete solution method for such constraints using Boolean Gröbner bases. A Boolean Gröbner base is a modifica...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1991
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
680 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Any constraint over sets can be represented in terms of a Boolean polynomial ring whenever the family of sets that we consider forms a Boolean ring. In this paper we give a complete solution method for such constraints using Boolean Gröbner bases. A Boolean Gröbner base is a modification of a standard Gröbner base which we developed to solve constraints of general Boolean polynomial rings." |
| Beschreibung: | 10 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010954520 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960917s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)26039974 | ||
| 035 | |a (DE-599)BVBBV010954520 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Sato, Yosuke |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Solving constraints over sets by Boolean Gröbner bases |c by Y. Sato, S. Menju & K. Sakai |
| 264 | 1 | |a Tokyo, Japan |c 1991 | |
| 300 | |a 10 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 680 | |
| 520 | 3 | |a Abstract: "Any constraint over sets can be represented in terms of a Boolean polynomial ring whenever the family of sets that we consider forms a Boolean ring. In this paper we give a complete solution method for such constraints using Boolean Gröbner bases. A Boolean Gröbner base is a modification of a standard Gröbner base which we developed to solve constraints of general Boolean polynomial rings." | |
| 650 | 4 | |a Boolean rings | |
| 650 | 4 | |a Logic programming | |
| 700 | 1 | |a Menju, Satoshi |e Verfasser |4 aut | |
| 700 | 1 | |a Sakai, Ko |e Verfasser |4 aut | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 680 |w (DE-604)BV010923438 |9 680 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007326863 | ||
Datensatz im Suchindex
| _version_ | 1804125441468923904 |
|---|---|
| any_adam_object | |
| author | Sato, Yosuke Menju, Satoshi Sakai, Ko |
| author_facet | Sato, Yosuke Menju, Satoshi Sakai, Ko |
| author_role | aut aut aut |
| author_sort | Sato, Yosuke |
| author_variant | y s ys s m sm k s ks |
| building | Verbundindex |
| bvnumber | BV010954520 |
| ctrlnum | (OCoLC)26039974 (DE-599)BVBBV010954520 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01465nam a2200325 cb4500</leader><controlfield tag="001">BV010954520</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960917s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)26039974</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010954520</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">Sato, Yosuke</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Solving constraints over sets by Boolean Gröbner bases</subfield><subfield code="c">by Y. Sato, S. Menju & K. Sakai</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10 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">680</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Any constraint over sets can be represented in terms of a Boolean polynomial ring whenever the family of sets that we consider forms a Boolean ring. In this paper we give a complete solution method for such constraints using Boolean Gröbner bases. A Boolean Gröbner base is a modification of a standard Gröbner base which we developed to solve constraints of general Boolean polynomial rings."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Boolean rings</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Menju, Satoshi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sakai, Ko</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">680</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">680</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007326863</subfield></datafield></record></collection> |
| id | DE-604.BV010954520 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:37Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007326863 |
| oclc_num | 26039974 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 10 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| 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 | Sato, Yosuke Verfasser aut Solving constraints over sets by Boolean Gröbner bases by Y. Sato, S. Menju & K. Sakai Tokyo, Japan 1991 10 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 680 Abstract: "Any constraint over sets can be represented in terms of a Boolean polynomial ring whenever the family of sets that we consider forms a Boolean ring. In this paper we give a complete solution method for such constraints using Boolean Gröbner bases. A Boolean Gröbner base is a modification of a standard Gröbner base which we developed to solve constraints of general Boolean polynomial rings." Boolean rings Logic programming Menju, Satoshi Verfasser aut Sakai, Ko Verfasser aut Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 680 (DE-604)BV010923438 680 |
| spellingShingle | Sato, Yosuke Menju, Satoshi Sakai, Ko Solving constraints over sets by Boolean Gröbner bases Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Boolean rings Logic programming |
| title | Solving constraints over sets by Boolean Gröbner bases |
| title_auth | Solving constraints over sets by Boolean Gröbner bases |
| title_exact_search | Solving constraints over sets by Boolean Gröbner bases |
| title_full | Solving constraints over sets by Boolean Gröbner bases by Y. Sato, S. Menju & K. Sakai |
| title_fullStr | Solving constraints over sets by Boolean Gröbner bases by Y. Sato, S. Menju & K. Sakai |
| title_full_unstemmed | Solving constraints over sets by Boolean Gröbner bases by Y. Sato, S. Menju & K. Sakai |
| title_short | Solving constraints over sets by Boolean Gröbner bases |
| title_sort | solving constraints over sets by boolean grobner bases |
| topic | Boolean rings Logic programming |
| topic_facet | Boolean rings Logic programming |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT satoyosuke solvingconstraintsoversetsbybooleangrobnerbases AT menjusatoshi solvingconstraintsoversetsbybooleangrobnerbases AT sakaiko solvingconstraintsoversetsbybooleangrobnerbases |