Formalizing soft constraints by interpretation ordering:
Abstract: "In the area of synthesis problem [sic] such as scheduling, design and planning, there are two kinds of constraints. One kind is a hard constraint which a solution must satisfy. The other is a soft constraint which represents preference over solutions. In this paper, we provide a logi...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1989
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
513 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In the area of synthesis problem [sic] such as scheduling, design and planning, there are two kinds of constraints. One kind is a hard constraint which a solution must satisfy. The other is a soft constraint which represents preference over solutions. In this paper, we provide a logical foundation of soft constraints. Let hard constraints be represented as first-order formulas. Then a solution to those hard constraints becomes an interpretation which satisfies the axiom set, and soft constraints can be regarded as providing an order over those interpretations, and the most preferred solutions are the most preferred interpretations in that order We use a meta-language which presents a preference order directly. This meta-language can be translated into the second-order formula to provide a syntactical definition of the most preferred solutions. We also give a method to calculate all the most preferred solutions based on the proof theory and the model theory. |
| Beschreibung: | 26 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010948884 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960913s1989 |||| 00||| engod | ||
| 035 | |a (OCoLC)25298100 | ||
| 035 | |a (DE-599)BVBBV010948884 | ||
| 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 Formalizing soft constraints by interpretation ordering |c by K. Satoh |
| 264 | 1 | |a Tokyo, Japan |c 1989 | |
| 300 | |a 26 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 513 | |
| 520 | 3 | |a Abstract: "In the area of synthesis problem [sic] such as scheduling, design and planning, there are two kinds of constraints. One kind is a hard constraint which a solution must satisfy. The other is a soft constraint which represents preference over solutions. In this paper, we provide a logical foundation of soft constraints. Let hard constraints be represented as first-order formulas. Then a solution to those hard constraints becomes an interpretation which satisfies the axiom set, and soft constraints can be regarded as providing an order over those interpretations, and the most preferred solutions are the most preferred interpretations in that order | |
| 520 | 3 | |a We use a meta-language which presents a preference order directly. This meta-language can be translated into the second-order formula to provide a syntactical definition of the most preferred solutions. We also give a method to calculate all the most preferred solutions based on the proof theory and the model theory. | |
| 650 | 4 | |a Design | |
| 650 | 4 | |a Planning | |
| 650 | 4 | |a Problem solving | |
| 650 | 4 | |a Production scheduling | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 513 |w (DE-604)BV010923438 |9 513 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007322857 | ||
Datensatz im Suchindex
| _version_ | 1804125435813953536 |
|---|---|
| any_adam_object | |
| author | Satoh, Ken 1959- |
| author_GND | (DE-588)134075757 |
| author_facet | Satoh, Ken 1959- |
| author_role | aut |
| author_sort | Satoh, Ken 1959- |
| author_variant | k s ks |
| building | Verbundindex |
| bvnumber | BV010948884 |
| ctrlnum | (OCoLC)25298100 (DE-599)BVBBV010948884 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02025nam a2200337 cb4500</leader><controlfield tag="001">BV010948884</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960913s1989 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25298100</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010948884</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">Formalizing soft constraints by interpretation ordering</subfield><subfield code="c">by K. Satoh</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">26 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">513</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In the area of synthesis problem [sic] such as scheduling, design and planning, there are two kinds of constraints. One kind is a hard constraint which a solution must satisfy. The other is a soft constraint which represents preference over solutions. In this paper, we provide a logical foundation of soft constraints. Let hard constraints be represented as first-order formulas. Then a solution to those hard constraints becomes an interpretation which satisfies the axiom set, and soft constraints can be regarded as providing an order over those interpretations, and the most preferred solutions are the most preferred interpretations in that order</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We use a meta-language which presents a preference order directly. This meta-language can be translated into the second-order formula to provide a syntactical definition of the most preferred solutions. We also give a method to calculate all the most preferred solutions based on the proof theory and the model theory.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Design</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Planning</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Problem solving</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Production scheduling</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">513</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">513</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007322857</subfield></datafield></record></collection> |
| id | DE-604.BV010948884 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:31Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007322857 |
| oclc_num | 25298100 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 26 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| 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 Formalizing soft constraints by interpretation ordering by K. Satoh Tokyo, Japan 1989 26 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 513 Abstract: "In the area of synthesis problem [sic] such as scheduling, design and planning, there are two kinds of constraints. One kind is a hard constraint which a solution must satisfy. The other is a soft constraint which represents preference over solutions. In this paper, we provide a logical foundation of soft constraints. Let hard constraints be represented as first-order formulas. Then a solution to those hard constraints becomes an interpretation which satisfies the axiom set, and soft constraints can be regarded as providing an order over those interpretations, and the most preferred solutions are the most preferred interpretations in that order We use a meta-language which presents a preference order directly. This meta-language can be translated into the second-order formula to provide a syntactical definition of the most preferred solutions. We also give a method to calculate all the most preferred solutions based on the proof theory and the model theory. Design Planning Problem solving Production scheduling Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 513 (DE-604)BV010923438 513 |
| spellingShingle | Satoh, Ken 1959- Formalizing soft constraints by interpretation ordering Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Design Planning Problem solving Production scheduling |
| title | Formalizing soft constraints by interpretation ordering |
| title_auth | Formalizing soft constraints by interpretation ordering |
| title_exact_search | Formalizing soft constraints by interpretation ordering |
| title_full | Formalizing soft constraints by interpretation ordering by K. Satoh |
| title_fullStr | Formalizing soft constraints by interpretation ordering by K. Satoh |
| title_full_unstemmed | Formalizing soft constraints by interpretation ordering by K. Satoh |
| title_short | Formalizing soft constraints by interpretation ordering |
| title_sort | formalizing soft constraints by interpretation ordering |
| topic | Design Planning Problem solving Production scheduling |
| topic_facet | Design Planning Problem solving Production scheduling |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT satohken formalizingsoftconstraintsbyinterpretationordering |