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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Satoh, Ken 1959- (VerfasserIn), Aiba, Akira (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Tokyo, Japan 1991
Schriftenreihe:	Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 610
Schlagworte:	Logic programming
Zusammenfassung:	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].
Beschreibung:	19 S.