Constraint Hierarchies and Logic Programming
@inproceedings{Borning1989ConstraintHA, title={Constraint Hierarchies and Logic Programming}, author={A. Borning and Michael J. Maher and Amy Martindale and M. Wilson}, booktitle={ICLP}, year={1989} }
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, page layout, and decision support, one needs to express preferences as well as strict requirements. If we wish to make full use of the constraint… CONTINUE READING
Figures and Topics from this paper
Figures
156 Citations
An Efficient Algorithm of Logic Programming with Constraint Hierarchy
- Computer Science
- CCL
- 1994
- 3
- Highly Influenced
Handling Preferences in Constraint Logic Programming with Relational Optimization
- Computer Science
- PLILP
- 1994
- 21
References
SHOWING 1-10 OF 52 REFERENCES
The definition and implementation of a computer programming language based on constraints
- Computer Science
- 1980
- 274
The DeltaBlue algorithm: an incremental constraint hierarchy solver
- Computer Science
- Eighth Annual International Phoenix Conference on Computers and Communications. 1989 Conference Proceedings
- 1989
- 36
CONSTRAINTS - A Language for Expressing Almost-Hierarchical Descriptions
- Computer Science
- Artif. Intell.
- 1980
- 511
- PDF