Skip to main content
SpringerLink
Log in

Constraints in NUT

  • Conference paper
Constraint Programming

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

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Freuder, E.C., Wallace, R.J. (1992) Partial Constraint Satisfaction — Artificial Intelligence, 58, pp. 21–70.

    Google Scholar 

  • 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 

  • 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 

  • 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 

  • Mackworth, A.K. (1992) The Logic of Constraint Satisfaction. — Artificial Intelligence, 58, pp. 3–20.

    Article  MathSciNet  MATH  Google Scholar 

  • Matskin, M. (1991) NUT System papers. — Computer Science Department. Aarhus University, DAIMI MD-59.

    Google Scholar 

  • Matskin, M., Tyugu, E. (1992) The NUT language. — TRITA-TCS-SE-92-TR. Royal Institute of Technology, Stockholm.

    Google Scholar 

  • Mints, G., Tyugu, E. (1983) Justification of the Structural Synthesis of Programs. — Science of Computer Programming, 2, no. 3, pp. 215–240.

    Article  MathSciNet  Google Scholar 

  • Mints, G., Tyugu, E. (1988) The Programming System PRIZ. — Journal of Symbolic Computations, 5, pp. 359–375.

    Article  MATH  Google Scholar 

  • Mints, G., Tyugu, E. (1990) Propositional Logic Programming and the PRIZ system. — Journal of Logic Programming, 9 no. 2–3, pp. 179–194.

    Article  MathSciNet  Google Scholar 

  • Penjam, J. (1990) Computational and Attribute Models of Formal Languages. — Theoretical Comp. Sci., 71, pp. 241–264.

    Article  MathSciNet  MATH  Google Scholar 

  • Saraswat, V. (1990) Concurrent Constraint Programming. — Proc. of the 17th ACM Symposium on Principles of Programming Languages. San Francisco, pp. 232–245.

    Google Scholar 

  • Smolka, G., Henz, M., Wurtz, J. (1993) Object-Oriented Concurrent Constraint Programming in Oz. — DFKI RR-933–16. Saarbrucken.

    Google Scholar 

  • 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 

  • Tyugu, E. (1991) Three New-Generation Software Environments. — Communications of the ACM, 34 pp. 46–59.

    Google Scholar 

  • 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 

Download references

Author information

Authors and Affiliations

  1. Institute of Cybernetics, Akadeemia tee 21, EE0026, Tallinn, Estonia

    Jaan Penjam

  2. Inst för Teleinformatik, Kungl Tekniska Högskolan, Electrum 204, S-16440, Kista, Sweden

    Enn Tyugu

Authors
  1. Jaan Penjam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Enn Tyugu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Aarhus University, Ny Munkegade, Building 540, DK-8000, Aarhus C, Denmark

    Brian Mayoh

  2. Computer Science Department, Royal Institute of Technology, S-10044, Stockholm, Sweden

    Enn Tyugu

  3. Institute of Cybernetics, Estonian Academy of Sciences, 21 Adadeemia tee, EE-0026, Tallinn, Estonia

    Jaan Penjam

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Penjam, J., Tyugu, E. (1994). Constraints in NUT. In: Mayoh, B., Tyugu, E., Penjam, J. (eds) Constraint Programming. NATO ASI Series, vol 131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85983-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-85983-0_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-85985-4

  • Online ISBN: 978-3-642-85983-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation