Rule-aided constraint resolution in Laure

  • Yves Caseau
Conference paper

DOI: 10.1007/BFb0013534

Part of the Lecture Notes in Computer Science book series (LNCS, volume 567)
Cite this paper as:
Caseau Y. (1991) Rule-aided constraint resolution in Laure. In: Boley H., Richter M.M. (eds) Processing Declarative Knowledge. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence), vol 567. Springer, Berlin, Heidelberg


This paper presents how deductive rules can be used as heuristics to guide constraint resolution. We describe the LAURE language, which allows the definition of constraints on order-sorted finite domains. We propose a semantic for integrating rules and constraints in an object-oriented model. An algorithm for constraint resolution is described, which can be integrated with rule propagation. An illustration of relevance to AI problems is given with examples such as scheduling.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1991

Authors and Affiliations

  • Yves Caseau
    • 1
  1. 1.BellcoreMorristownUSA

Personalised recommendations