Update propagation network — A framework for constraint programming

  • Masayuki Numao
Constraint Logic Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 315)


As a framework for constraint programming, a Network model named Cell&Relation Model(CRM) is proposed and an update propagation mechanism is developed on top of the network. The model is used both to describe description of constraint programming and to offer a graphic model for logic programming. An update propagation mechanism, which is useful for on-line interactive systems, is selected as a constraint propagation mechanism. To deal with many-to-many and bidirectional mappings, the mechanism consists of a hypothesis-generating propagator and an evaluator. These components work concurrently; while the former is generating a hypothesis dynamically, the latter evaluates it and controls the propagation. Some heuristics are incorporated to localize the effects of the propagation. An extension to Prolog, named Constraint Prolog, is also included to deal with hypothetical reasoning and lazy evaluation. Constraint Prolog is the interpreter of the update propagation mechanism.


Logic Programming Constraint Programming Prolog Program Logic Programming Language Hypothetical Reasoning 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Borning A.(1981), “The Programming Language Aspect of ThingLab — a Constraint-Oriented Simulation Laboratory”, ACM TOPLAS, Vol.3, No.4.Google Scholar
  2. Colmerauer A.(1982), “Prolog-II Manual de Reference et Modele Theoretique”, Groupe Intelligence Artificelle, Universite d'Aix-Marsaille.Google Scholar
  3. Jaffar J., Michaylov S.(1987), “Methodology and Implementation of a CLP System”, 4th International Logic Programming Conference, MIT Press.Google Scholar
  4. Morishita S. et al.(1987), “Symbolical Construction of Truth Valued Domain for Logic Programs”, 4th International Logic Programming Conference, MIT Press.Google Scholar
  5. Naish L.(1986), “Negation and Control in Prolog”, Lecture Notes in Computer Science 238, Springer-Verlag.Google Scholar
  6. Sussman G., Steele Jr G.(1980), “Constraints-A Language for Expressing Almost-Hierarchical Descriptions”, Artificial Intelligence, Vol.14.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Masayuki Numao
    • 1
  1. 1.Tokyo Research LaboratoryIBM Japan Ltd.TokyoJapan

Personalised recommendations