Abstract: "Hierarchical Constraint Logic Programming (HCLP) is an extension of Constraint Logic Programming (CLP) that allows a programmer to specify defaults and preferences, as well as required constraints. HCLP defines a family of languages that are parameterized both by the domain over whic...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Wilson, Molly (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Seattle, Wash. 1991
Schriftenreihe:	University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report 91,2,4
Schlagworte:	Logic programming
Zusammenfassung:	Abstract: "Hierarchical Constraint Logic Programming (HCLP) is an extension of Constraint Logic Programming (CLP) that allows a programmer to specify defaults and preferences, as well as required constraints. HCLP defines a family of languages that are parameterized both by the domain over which the constraints are defined, and by the method, or comparator, that is used to define solutions to the non-required constraints. In previous work, we gave a formal operational semantics for the class of HCLP languages and specified a logical semantics for those HCLP programs whose non-required constraints were omitted In this paper, these results are extended to a description of the formal semantics of complete HCLP programs (i.e. those with required and non-required constraints). First, the operational semantics are reviewed. Then a proof-theory and a fixed-point characterization are given and shown to be equivalent to the operational one.
Beschreibung:	14 S.