Skip to main content
SpringerLink
Log in

Constraint Satisfaction and Constraint Programming: A Brief Lead-In

  • Conference paper
Constraint Programming

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

Abstract

This paper presents the authors’ vision about the achievements and expected further developments in the paradigm and techniques of constraint solving, and in applying these in programming

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

  • Aiba, A., Sakai, K., Sato, Y., Hawley, D. J., Hasegawa, R. 1988. Constraint logic programming language CAL. In Proc. Int’1 Conf. on Fifth Generation Computer Systems, Tokyo, Japan, Dec 1988, 263–276. Tokyo: Ohmsha Publishers

    Chapter  Google Scholar 

  • Bibel, W. 1988. Constraint satisfaction from a deductive viewpoint. Artificial Intelligence 35 (3), 401–413

    Article  MathSciNet  MATH  Google Scholar 

  • Borning, A., Duisberg, R., Freeman-Benson, B. N., Cramer, A., Woolf, M. 1987. Constraint hierarchies. In Proc. ACM Conf. on Object-Oriented Programming Systems, Languages and Applications, OOPSLA’87, Orlando, FL, USA, Oct 1987, 48–60. ACM

    Google Scholar 

  • Borning, A., Freeman-Benson, B. N., Wilson, M. 1992. Constraint hierarchies. Lisp and Symbolic Computation 5 (3), 223–270

    Article  Google Scholar 

  • Buchberger, B. 1985. Gröbner bases: An algorithmic method in polynomial ideal theory. In Bose, N. K. (ed.), Multidimensional systems theory, 184–232. Dordrecht: D. Reidel

    Chapter  Google Scholar 

  • Cohen, J. 1990. Constraint logic programming languages. Communications of the ACM 33 (7), 52–68

    Article  Google Scholar 

  • Collins, G. E. 1975. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In Proc. 2nd GI Conf. on Automata Theory and Formal Languages, 515–532. LNCS 33 Berlin: Springer-Verlag.

    Google Scholar 

  • Colmerauer, A. 1990. An introduction to Prolog-III. Communications of the ACM 33 (7), 69–90

    Article  Google Scholar 

  • Dechter, R. 1990. Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition. Artificial Intelligence 41 (3), 273–312

    Article  Google Scholar 

  • Dechter, R., Pearl, J. 1988. Network-based heuristics for constraint-satisfaction problems. Artificial Intelligence 34 (1), 1–38

    Article  MathSciNet  Google Scholar 

  • Dechter, R., Pearl, J. 1989. Tree clustering for constraint networks. Artificial Intelligence 38 (3), 353–66

    Article  MathSciNet  MATH  Google Scholar 

  • Dincbas, M., Van Hentenryck, P., Simonis, H., Aggoun, A., Graf, T., Berthier, F. 1988. The constraint logic programming language CHIP. In Proc. Int’l Conf. on Fifth Generation Computer Systems, Tokyo, Japan, Dec 1988, 693–702. Tokyo: Ohmsha Publishers

    Google Scholar 

  • Franzén, T., Haridi, S., Janson, S. 1991. An overview of the Andorra Kernel Language. In Eriksson, L.-H., Hallnäs, L., Schroeder-Heister, P. (eds), Proc. 2nd Int’l Workshop on Extensions of Logic Programming, ELP’91, Stockholm, Sweden, Jan 1991, 163–179. LNAI 596 Berlin: Springer-Verlag.

    Google Scholar 

  • Freeman-Benson, B., Borning, A. 1992. Integrating constraints with an object-oriented language. In Lehrmann Madsen, O.(ed), Proc. European Conf. on Object-Oriented Programming, ECOOP’92, Utrecht, The Netherlands, June/July 1992, 268–86. Berlin: Springer-Verlag. LNCS 615

    Google Scholar 

  • Frühwirth, T., Herold, A., Küchenhoff, V., Le Provost, T., Lim, P., Monfroy, E., Wallace, M. 1992. Constraint logic programming: An informal introduction. In Comyn, G., Fuchs, N. E., Ratcliffe, M. J. (eds), Logic Programming in Action: Proc. 2nd Int’l Logic Programming Summer School, LPSS’92, Zürich, Switzerland, Sept 1992, 3–35. Berlin: Springer-Verlag. LNAI 636

    Google Scholar 

  • Freuder, E. C., Wallace, R. J. 1992. Partial constraint satisfaction. Artificial Intelligence bf 58 (13), 21–70

    Article  MathSciNet  Google Scholar 

  • Guesgen, H. W., Hertzberg, J. 1992. A Perspective of Constraint-Based Reasoning: An Introductory Tutorial. Berlin: Springer-Verlag. LNAI 597

    Chapter  Google Scholar 

  • Hyvönen, E. 1992. Constraint reasoning based on interval arithmetic: The tolerance propagation approach. Artificial Intelligence 58 (13), 71–112

    Article  MathSciNet  MATH  Google Scholar 

  • Jaffar, J., Lassez, J.-L. 1987. Constraint logic programming. In Conf. Record 14th Annual ACM Symp. on Principles of Programming Languages, Munich, West Germany, Jan 1987, 111–119. ACM SIGACT/SIGPLAN

    Google Scholar 

  • Jaffar, J., Lassez, J.-L. 1988. From unification to constraints. In Furukawa, K., Tanaka, H., Fujisaki, T. (eds), Logic Programming ‘87: Proc. 6th (Japanese) Conf. Tokyo, Japan, June 1987, 1–18. Berlin: Springer-Verlag. LNCS 315

    Google Scholar 

  • Jaffar, J., Michaylov, S. 1987. Methodology and implementation of a constraint logic programming system. In Proc. 4th Int’l Conf. on Logic Programming, Melbourne, Australia, 1987, 196–218. The MIT Press

    Google Scholar 

  • Kahn, K. M. 1992. Concurrent constraint programs to parse and animate pictures of concurrent constraint programs. In Proc. Int’l Conf. on Fifth Generation Computer Systems, Tokyo, Japan, June 1992. ICOT: Tokyo

    Google Scholar 

  • Latombe, J.-C. (ed) 1978. Proc. IFIP Workshop on Artificial Intelligence and Pattern Recognition in CAD. Amsterdam: North-Holland

    Google Scholar 

  • Lauriere, J.-L. 1978. A language and a program for stating and solving combinatorial problems. Artificial Intelligence 10 (1), 29–127

    Article  MathSciNet  MATH  Google Scholar 

  • Lincoln, P., Saraswat, V. A. 1991. Proofs as concurrent processes: A logical interpretation for concurrent constraint programming. Technical report, Systems Sciences Laboratory, Xerox PARC, Palo Alto, CA

    Google Scholar 

  • Lopez, G., Freeman-Benson, B. N., Borning, A. 1994. Kaleidoscope: A constraint imperative programming language. In this volume

    Google Scholar 

  • Mackworth, A. K. 1977. Consistency in networks of relations. Artificial Intelligence 8 (1), 99–118

    Article  MathSciNet  MATH  Google Scholar 

  • Mackworth, A. K. 1992. The logic of constraint satisfaction. Artificial Intelligence 58 (13), 3–20

    Article  MathSciNet  MATH  Google Scholar 

  • Mackworth, A. K., Freuder, E. C. 1985. The complexity of some polynomial network consistency algorithms for constraint satisfaction problem. Artificial Intelligence 25 (1), 65–74

    Article  Google Scholar 

  • Martin, U., Nipkov, T. 1990. Boolean unification: The story so far. In Kirchner, C. (ed), Unification. Academic Press

    Google Scholar 

  • Mints, G., Tyugu, E. 1983. Justification of the structural synthesis of programs. Science of Computer Programming 2, 215–240

    Article  MathSciNet  Google Scholar 

  • Mohr, R., Henderson, T. C. 1986. Arc and path consistency revisited. Artificial Intelligence 28 (2), 225–233

    Article  Google Scholar 

  • Montanari, U. 1974. Networks of constraints: Fundamental properties and application to picture processing. Information Sciences 7 (2), 95–132

    Article  MathSciNet  MATH  Google Scholar 

  • Montanari, U., Rossi, F. 1991a. Constraint relaxation may be perfect. Artificial Intelligence 48 (2), 143–170

    Article  MathSciNet  MATH  Google Scholar 

  • Montanari, U., Rossi, F. 1991b. Perfect relaxation in constraint logic programming. In Furukawa, K. (ed.), Proc. 8th Int’l Conf. on Logic Programming, Paris, France, June 1991, 223–237. Cambridge, MA: The MIT Press

    Google Scholar 

  • Montanari, U., Rossi, F. 1991c. True concurrency in concurrent constraint logic programming. In Saraswat, V., Ueda, K. (eds), Proc. 1991 Symp. on Logic Programming, 694–713

    Google Scholar 

  • Montanari, U., Rossi, F. 1992. An event structure semantics for concurrent constraint programming. Submitted for publication

    Google Scholar 

  • Montanari, U., Rossi, F. 1993a. Contextual occurrence nets and concurrent constraint programming. In Proc. Dagstuhl Seminar on Graph Transformations in Computer Science, Jan 1993, Berlin: Springer-Verlag. LNCS

    Google Scholar 

  • Montanari, U., Rossi, F. 1993b. Graph rewriting for a partial ordering semantics of concurrent constraint programming. Theoretical Computer Science 109, 225–56

    Article  MathSciNet  MATH  Google Scholar 

  • Panangaden, P., Saraswat, V. A., Scott, P. J., Seely, R. A. G. 1991. What is a constraint system? Technical report, Xerox Parc, Palo Alto, CA

    Google Scholar 

  • Saraswat, V. A. 1992a. The category of constraint systems is cartesian-closed. In Proc. 7th Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, CA, USA, June 1992, 341–345. Los Alamitos, CA: IEEE Comp. Soc. Press

    Google Scholar 

  • Saraswat, V. A. 1992b. Concurrent constraint programming: A survey. Technical report, Xerox PARC, Palo Alto, CA

    Google Scholar 

  • Saraswat, V. A., Kahn, K. M., Levy, J. 1989. Programming in Janus. Technical report, Xerox PARC, Palo Alto, CA

    Google Scholar 

  • Saraswat, V. A., Kahn, K. M., Levy, J. 1990. Janus: A step towards distributed constraint programming. In Proc. North American Conf. on Logic Programming, Austin, TX, USA, Oct 1990.

    Google Scholar 

  • Saraswat, V. A., Lincoln, P. 1992. Higher-order, linear concurrent constraint programming. Technical report, Xerox PARC, Palo Alto, CA

    Google Scholar 

  • Saraswat, V. A., Rinard, M. 1990. Concurrent constraint programming. In Conf. Record 17th Annual ACM Symp. on Principles of Programming Languages, San Fransisco, CA, USA, Jan 1990, 232–245. ACM SIGPLAN/SIGACT

    Google Scholar 

  • Saraswat, V. A., Rinard, M., Panangaden, P. 1990. Semantic foundations of concurrent constraint programming. In Conf. Record 18th Annual ACM Symp. on Principles of Programming Languages, Orlando, FL, USA, 1991, 333–352. ACM SIGPLAN/SIGACT

    Google Scholar 

  • Shapiro, E. 1989. The family of concurrent logic programming languages. ACM Computing Surveys 21 (3), 413–510

    Article  Google Scholar 

  • Smolka, G., Henz, M., Würtz, J. 1993. Object-oriented concurrent constraint programming in Oz. Research Report RR-93–16, DFKI, Saarbrücken

    Google Scholar 

  • Sussman, G. J., Steele Jr. G. L. 1980. CONSTRAINTS—a language for expressing almost-hierarchical descriptions. Artificial Intelligence bf 14 (1), 1–39

    Article  Google Scholar 

  • Sutherland, I. E. 1963. Sketchpad: A man-machine graphical communication system. In Proc. AFIPS Spring Joint Computer Conf., Detroit, MI, USA, 1963, 329–346

    Google Scholar 

  • Tyugu, E. 1970. Solving problems on computational models. J. Computational Mathematics and Math. Phys. 10, 716–33

    MathSciNet  MATH  Google Scholar 

  • Tyugu, E., Uustalu, T. 1994. Higher-order functional constraint networks. In this volume

    Google Scholar 

  • Van Hentenryck, P., Deville, Y., Teng, C.-M. 1992. A generic arc-consistency algorithm and its specializations. Artificial Intelligence 57 (23), 291–321

    Article  MathSciNet  MATH  Google Scholar 

  • Voda, P. 1988. The constraint language Trilogy: Semantics and computations. Technical report, Complete Logic Systems, North Vancouver, BC

    Google Scholar 

  • Waltz, D. L. 1972. Generating semantic descriptions from drawings of scenes with shadows. Technical Report AI-TR-271, MIT

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Dept, Aarhus University, Ny Munkegade 540, DK-8000, Aarhus, Denmark

    Brian Mayoh

  2. Dept of Teleinformatics, The Royal Institute of Technology, Electrum 204, S-164 40, Kista, Sweden

    Enn Tyugu & Tarmo Uustalu

Authors
  1. Brian Mayoh
    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

  3. Tarmo Uustalu
    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

Mayoh, B., Tyugu, E., Uustalu, T. (1994). Constraint Satisfaction and Constraint Programming: A Brief Lead-In. 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_1

Download citation

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

  • 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