Constraints in NUT

Conference paper
Part of the NATO ASI Series book series (NATO ASI F, volume 131)


NUT is a programming system for knowledge-based programming with facilities for automatic program synthesis. The system allows to specify computational problems in OO style. Concepts and objects can be treated in NUT as functional constraint networks. Constraint satisfaction problems are solved using algorithms for automatic program synthesis described earlier for the PRIZ system.


Constraint Programming Constraint Satisfaction Problem Functional Constraint Identity Relation Object Manipulation 
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. Freuder, E.C., Wallace, R.J. (1992) Partial Constraint Satisfaction — Artificial Intelligence, 58, pp. 21–70.Google Scholar
  2. Jaffar, J., Lassez J.-L. (1987) Constraint Logic Programming. — Proc. of the 14th ACM Symposium on Principles of Programming Languages. Munich, pp. 111–119.Google Scholar
  3. Kalja, A., Pahapill, J. (1992) Small Knowledge CAD Systems. — Information Modelling and Knowledge Bases III: Foundations, Theory and Applications, IOC Press, Amsterdam, pp. 347–356 the 14th ACM Symposium on Principles of Programming Languages. Munich, 1987, pp. 111–119.Google Scholar
  4. Kotov, V., Nariniani, A., Tyugu, E. (1989) The USSR Academy of Sciences START Project. — Information Processing 89 (IFIP’89). North Holland, pp. 623–626.Google Scholar
  5. Mackworth, A.K. (1992) The Logic of Constraint Satisfaction. — Artificial Intelligence, 58, pp. 3–20.MathSciNetCrossRefzbMATHGoogle Scholar
  6. Matskin, M. (1991) NUT System papers. — Computer Science Department. Aarhus University, DAIMI MD-59.Google Scholar
  7. Matskin, M., Tyugu, E. (1992) The NUT language. — TRITA-TCS-SE-92-TR. Royal Institute of Technology, Stockholm.Google Scholar
  8. Mints, G., Tyugu, E. (1983) Justification of the Structural Synthesis of Programs. — Science of Computer Programming, 2, no. 3, pp. 215–240.MathSciNetCrossRefGoogle Scholar
  9. Mints, G., Tyugu, E. (1988) The Programming System PRIZ. — Journal of Symbolic Computations, 5, pp. 359–375.CrossRefzbMATHGoogle Scholar
  10. Mints, G., Tyugu, E. (1990) Propositional Logic Programming and the PRIZ system. — Journal of Logic Programming, 9 no. 2–3, pp. 179–194.MathSciNetCrossRefGoogle Scholar
  11. Penjam, J. (1990) Computational and Attribute Models of Formal Languages. — Theoretical Comp. Sci., 71, pp. 241–264.MathSciNetCrossRefzbMATHGoogle Scholar
  12. Saraswat, V. (1990) Concurrent Constraint Programming. — Proc. of the 17th ACM Symposium on Principles of Programming Languages. San Francisco, pp. 232–245.Google Scholar
  13. Smolka, G., Henz, M., Wurtz, J. (1993) Object-Oriented Concurrent Constraint Programming in Oz. — DFKI RR-933–16. Saarbrucken.Google Scholar
  14. Tyugu, E., Matskin M., Penjam J., Eomois P. (1986) NUT — An Object-Oriented Language. — Computers and Artificial Intelligence, 5, no. 6, pp. 521–542. Tyugu, E. (1988) Knowledge-Based Programming. — Addison-Wesley, N.Y., 1988.Google Scholar
  15. Tyugu, E. (1991) Three New-Generation Software Environments. — Communications of the ACM, 34 pp. 46–59.Google Scholar
  16. Tyugu, E., Uustalu, T. (1993) Higher-Order Functional Constraint Networks. — In B. Mayoh, E. Tyugu, J. Penjam (eds.) Constraint Programming. NATO ASI Series F, Vol. 131. Springer-Verlag, Berlin, 1994 (this volume).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  1. 1.Institute of CyberneticsTallinnEstonia
  2. 2.Inst för TeleinformatikKungl Tekniska HögskolanKistaSweden

Personalised recommendations