Computing soft constraints by hierarchical constraint logic programming:
Abstract: "We have formalized soft constraints in [11] based on interpretation ordering which is a generalization of circumscription. However, this formalization is written in a second-order formula and therefore is not computable in general. To make it computable, we have to introduce some res...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Tokyo, Japan
1991
|
| Series: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
610 |
| Subjects: | |
| Summary: | Abstract: "We have formalized soft constraints in [11] based on interpretation ordering which is a generalization of circumscription. However, this formalization is written in a second-order formula and therefore is not computable in general. To make it computable, we have to introduce some restriction. In this paper, we propose a semantic restriction. By semantic restriction, we mean that we fix the considered domain so that interpretations of domain-dependent relations are fixed, and soft and hard constraints contain only domain-dependent relations. If we accept this restriction, the soft constraints can be expressed in a first- order formula Moreover, there is already a proposed mechanism suitable for computing such restricted soft constraints in the literature, that is, hierarchical constraint logic programming languages (HCLP languages) [2,9]. Firstly, we identify a solution to constraint hierarchy defined by HCLP languages with the most preferable solution for semantically-restricted soft constraints. Then, we provide an algorithm for calculating all the most preferable solutions for soft constraints without any redundant calls of constraint solver. Then, we show examples of computing soft constraints by using our HCLP language named CHAL (Constraintes Hierarchiques avec Logique) [9]. |
| Physical Description: | 19 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010953715 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960917s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)25180466 | ||
| 035 | |a (DE-599)BVBBV010953715 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Satoh, Ken |d 1959- |e Verfasser |0 (DE-588)134075757 |4 aut | |
| 245 | 1 | 0 | |a Computing soft constraints by hierarchical constraint logic programming |c by K. Satoh & A. Aiba |
| 264 | 1 | |a Tokyo, Japan |c 1991 | |
| 300 | |a 19 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 610 | |
| 520 | 3 | |a Abstract: "We have formalized soft constraints in [11] based on interpretation ordering which is a generalization of circumscription. However, this formalization is written in a second-order formula and therefore is not computable in general. To make it computable, we have to introduce some restriction. In this paper, we propose a semantic restriction. By semantic restriction, we mean that we fix the considered domain so that interpretations of domain-dependent relations are fixed, and soft and hard constraints contain only domain-dependent relations. If we accept this restriction, the soft constraints can be expressed in a first- order formula | |
| 520 | 3 | |a Moreover, there is already a proposed mechanism suitable for computing such restricted soft constraints in the literature, that is, hierarchical constraint logic programming languages (HCLP languages) [2,9]. Firstly, we identify a solution to constraint hierarchy defined by HCLP languages with the most preferable solution for semantically-restricted soft constraints. Then, we provide an algorithm for calculating all the most preferable solutions for soft constraints without any redundant calls of constraint solver. Then, we show examples of computing soft constraints by using our HCLP language named CHAL (Constraintes Hierarchiques avec Logique) [9]. | |
| 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 610 |w (DE-604)BV010923438 |9 610 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007326179 | ||
Record in the Search Index
| _version_ | 1804125440582877184 |
|---|---|
| any_adam_object | |
| author | Satoh, Ken 1959- Aiba, Akira |
| author_GND | (DE-588)134075757 |
| author_facet | Satoh, Ken 1959- Aiba, Akira |
| author_role | aut aut |
| author_sort | Satoh, Ken 1959- |
| author_variant | k s ks a a aa |
| building | Verbundindex |
| bvnumber | BV010953715 |
| ctrlnum | (OCoLC)25180466 (DE-599)BVBBV010953715 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02340nam a2200313 cb4500</leader><controlfield tag="001">BV010953715</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)25180466</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010953715</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">Satoh, Ken</subfield><subfield code="d">1959-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)134075757</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computing soft constraints by hierarchical constraint logic programming</subfield><subfield code="c">by K. Satoh & A. Aiba</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">19 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">610</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We have formalized soft constraints in [11] based on interpretation ordering which is a generalization of circumscription. However, this formalization is written in a second-order formula and therefore is not computable in general. To make it computable, we have to introduce some restriction. In this paper, we propose a semantic restriction. By semantic restriction, we mean that we fix the considered domain so that interpretations of domain-dependent relations are fixed, and soft and hard constraints contain only domain-dependent relations. If we accept this restriction, the soft constraints can be expressed in a first- order formula</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Moreover, there is already a proposed mechanism suitable for computing such restricted soft constraints in the literature, that is, hierarchical constraint logic programming languages (HCLP languages) [2,9]. Firstly, we identify a solution to constraint hierarchy defined by HCLP languages with the most preferable solution for semantically-restricted soft constraints. Then, we provide an algorithm for calculating all the most preferable solutions for soft constraints without any redundant calls of constraint solver. Then, we show examples of computing soft constraints by using our HCLP language named CHAL (Constraintes Hierarchiques avec Logique) [9].</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">610</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">610</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007326179</subfield></datafield></record></collection> |
| id | DE-604.BV010953715 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:36Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007326179 |
| oclc_num | 25180466 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 19 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 | Satoh, Ken 1959- Verfasser (DE-588)134075757 aut Computing soft constraints by hierarchical constraint logic programming by K. Satoh & A. Aiba Tokyo, Japan 1991 19 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 610 Abstract: "We have formalized soft constraints in [11] based on interpretation ordering which is a generalization of circumscription. However, this formalization is written in a second-order formula and therefore is not computable in general. To make it computable, we have to introduce some restriction. In this paper, we propose a semantic restriction. By semantic restriction, we mean that we fix the considered domain so that interpretations of domain-dependent relations are fixed, and soft and hard constraints contain only domain-dependent relations. If we accept this restriction, the soft constraints can be expressed in a first- order formula Moreover, there is already a proposed mechanism suitable for computing such restricted soft constraints in the literature, that is, hierarchical constraint logic programming languages (HCLP languages) [2,9]. Firstly, we identify a solution to constraint hierarchy defined by HCLP languages with the most preferable solution for semantically-restricted soft constraints. Then, we provide an algorithm for calculating all the most preferable solutions for soft constraints without any redundant calls of constraint solver. Then, we show examples of computing soft constraints by using our HCLP language named CHAL (Constraintes Hierarchiques avec Logique) [9]. Logic programming Aiba, Akira Verfasser aut Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 610 (DE-604)BV010923438 610 |
| spellingShingle | Satoh, Ken 1959- Aiba, Akira Computing soft constraints by hierarchical constraint logic programming Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Logic programming |
| title | Computing soft constraints by hierarchical constraint logic programming |
| title_auth | Computing soft constraints by hierarchical constraint logic programming |
| title_exact_search | Computing soft constraints by hierarchical constraint logic programming |
| title_full | Computing soft constraints by hierarchical constraint logic programming by K. Satoh & A. Aiba |
| title_fullStr | Computing soft constraints by hierarchical constraint logic programming by K. Satoh & A. Aiba |
| title_full_unstemmed | Computing soft constraints by hierarchical constraint logic programming by K. Satoh & A. Aiba |
| title_short | Computing soft constraints by hierarchical constraint logic programming |
| title_sort | computing soft constraints by hierarchical constraint logic programming |
| topic | Logic programming |
| topic_facet | Logic programming |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT satohken computingsoftconstraintsbyhierarchicalconstraintlogicprogramming AT aibaakira computingsoftconstraintsbyhierarchicalconstraintlogicprogramming |