Structural analysis of the set of of constraints for constraint logic program:
Abstract: "The introduction of the constraint concept into logic programming provides constraint logic programming (CLP) with more declarative expressiveness power. However, there are cases when CLP languages cannot be efficiently implemented because of the domains of constraint. In particular,...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1991
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
701 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "The introduction of the constraint concept into logic programming provides constraint logic programming (CLP) with more declarative expressiveness power. However, there are cases when CLP languages cannot be efficiently implemented because of the domains of constraint. In particular, since we use a CAL language, an instance of the CLP scheme, and this algebraic constraint solver is based on the Buchberger algorithm and computes the Grobner base, it is necessary to process efficiently, by considering the order of constraint solving. Therefore, it is necessary to handle both the inference engine and the constraint solver to efficiently process the CLP Furthermore, to efficiently process constraints using the CAL language on applications using the Buchberger algorithm, it is necessary to construct as simple a Grobner base as possible. This paper describes a program analysis method to improve the efficiency of CLP program execution by introducing this graph-theoretic approach, while considering the active researches of program analysis of logic programming. We consider program analysis methods for the CAL language and apply this method to some examples including non-linear constraints. The results show that the proposed method is effective for problems where the algebraic structure of the set of constraints is sparse. |
| Beschreibung: | 16 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010955936 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960918s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)26483735 | ||
| 035 | |a (DE-599)BVBBV010955936 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Nagai, Yasuo |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Structural analysis of the set of of constraints for constraint logic program |c by Y. }agai ... |
| 264 | 1 | |a Tokyo, Japan |c 1991 | |
| 300 | |a 16 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 701 | |
| 520 | 3 | |a Abstract: "The introduction of the constraint concept into logic programming provides constraint logic programming (CLP) with more declarative expressiveness power. However, there are cases when CLP languages cannot be efficiently implemented because of the domains of constraint. In particular, since we use a CAL language, an instance of the CLP scheme, and this algebraic constraint solver is based on the Buchberger algorithm and computes the Grobner base, it is necessary to process efficiently, by considering the order of constraint solving. Therefore, it is necessary to handle both the inference engine and the constraint solver to efficiently process the CLP | |
| 520 | 3 | |a Furthermore, to efficiently process constraints using the CAL language on applications using the Buchberger algorithm, it is necessary to construct as simple a Grobner base as possible. This paper describes a program analysis method to improve the efficiency of CLP program execution by introducing this graph-theoretic approach, while considering the active researches of program analysis of logic programming. We consider program analysis methods for the CAL language and apply this method to some examples including non-linear constraints. The results show that the proposed method is effective for problems where the algebraic structure of the set of constraints is sparse. | |
| 650 | 4 | |a Logic programming | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 701 |w (DE-604)BV010923438 |9 701 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007328132 | ||
Datensatz im Suchindex
| _version_ | 1804125443094216704 |
|---|---|
| any_adam_object | |
| author | Nagai, Yasuo |
| author_facet | Nagai, Yasuo |
| author_role | aut |
| author_sort | Nagai, Yasuo |
| author_variant | y n yn |
| building | Verbundindex |
| bvnumber | BV010955936 |
| ctrlnum | (OCoLC)26483735 (DE-599)BVBBV010955936 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02307nam a2200301 cb4500</leader><controlfield tag="001">BV010955936</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960918s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)26483735</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010955936</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">Nagai, Yasuo</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Structural analysis of the set of of constraints for constraint logic program</subfield><subfield code="c">by Y. }agai ...</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">16 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">701</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The introduction of the constraint concept into logic programming provides constraint logic programming (CLP) with more declarative expressiveness power. However, there are cases when CLP languages cannot be efficiently implemented because of the domains of constraint. In particular, since we use a CAL language, an instance of the CLP scheme, and this algebraic constraint solver is based on the Buchberger algorithm and computes the Grobner base, it is necessary to process efficiently, by considering the order of constraint solving. Therefore, it is necessary to handle both the inference engine and the constraint solver to efficiently process the CLP</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Furthermore, to efficiently process constraints using the CAL language on applications using the Buchberger algorithm, it is necessary to construct as simple a Grobner base as possible. This paper describes a program analysis method to improve the efficiency of CLP program execution by introducing this graph-theoretic approach, while considering the active researches of program analysis of logic programming. We consider program analysis methods for the CAL language and apply this method to some examples including non-linear constraints. The results show that the proposed method is effective for problems where the algebraic structure of the set of constraints is sparse.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</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">701</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">701</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007328132</subfield></datafield></record></collection> |
| id | DE-604.BV010955936 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:38Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007328132 |
| oclc_num | 26483735 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 16 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 | Nagai, Yasuo Verfasser aut Structural analysis of the set of of constraints for constraint logic program by Y. }agai ... Tokyo, Japan 1991 16 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 701 Abstract: "The introduction of the constraint concept into logic programming provides constraint logic programming (CLP) with more declarative expressiveness power. However, there are cases when CLP languages cannot be efficiently implemented because of the domains of constraint. In particular, since we use a CAL language, an instance of the CLP scheme, and this algebraic constraint solver is based on the Buchberger algorithm and computes the Grobner base, it is necessary to process efficiently, by considering the order of constraint solving. Therefore, it is necessary to handle both the inference engine and the constraint solver to efficiently process the CLP Furthermore, to efficiently process constraints using the CAL language on applications using the Buchberger algorithm, it is necessary to construct as simple a Grobner base as possible. This paper describes a program analysis method to improve the efficiency of CLP program execution by introducing this graph-theoretic approach, while considering the active researches of program analysis of logic programming. We consider program analysis methods for the CAL language and apply this method to some examples including non-linear constraints. The results show that the proposed method is effective for problems where the algebraic structure of the set of constraints is sparse. Logic programming Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 701 (DE-604)BV010923438 701 |
| spellingShingle | Nagai, Yasuo Structural analysis of the set of of constraints for constraint logic program Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Logic programming |
| title | Structural analysis of the set of of constraints for constraint logic program |
| title_auth | Structural analysis of the set of of constraints for constraint logic program |
| title_exact_search | Structural analysis of the set of of constraints for constraint logic program |
| title_full | Structural analysis of the set of of constraints for constraint logic program by Y. }agai ... |
| title_fullStr | Structural analysis of the set of of constraints for constraint logic program by Y. }agai ... |
| title_full_unstemmed | Structural analysis of the set of of constraints for constraint logic program by Y. }agai ... |
| title_short | Structural analysis of the set of of constraints for constraint logic program |
| title_sort | structural analysis of the set of of constraints for constraint logic program |
| topic | Logic programming |
| topic_facet | Logic programming |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT nagaiyasuo structuralanalysisofthesetofofconstraintsforconstraintlogicprogram |