Hierarchical constraint logic programming

Hierarchical Constraint Logic Programming

Constraint Logic Programming (CLP) is a general scheme for extending logic programming to include constraints. It is parameterized by D, the domain of the constraints. However, CLP(D) languages, as well as most other constraint systems, only allow the programmer to specify constraints that must hold. In many applications, such as interactive graphics, planning, document formatting, and decision...

Fair Hierarchical Constraint Logic Programming

We propose a variant of Hierarchical Constraint Logic Programming (HCLP) which is more general than standard CLP, but less general than the HCLP scheme of Borning, Wilson, and others. We conjecture that our variant, Fair HCLP, will have better semantics than HCLP, especially under hierarchy composition, and will be more amenable to incremental implementations. 1 Motivation The HCLP scheme of Bo...

Extending Hierarchical Constraint Logic Programming: Nonmonotonicity and Inter-Hierarchy Comparison

Hierarchical Constraint Logic Programming languages extend Constraint Logic Programming to include constraint hierarchies. These languages provide both required constraints and default constraints of various strengths. In the original de nition of HCLP, alternate solutions to a given constraint hierarchy were compared, and only the \best" solutions were returned. However, there was no attempt t...

Constraint Logic Programming

Interval Constraint Logic Programming

In this paper, we present a n o verview on the use of interval arithmetic to process numerical constraints in Constraint Logic Programming. The main principle is to approximate n-ary relations over R I with Cartesian products of intervals whose bounds are taken in a nite subset of R I. V ariables represent real values whose domains are intervals deened in the same manner. Narrowing operators ar...