Skip to main content
SpringerLink
Log in

Formalizing Local Constraint Propagation Methods

  • Conference paper
Künstliche Intelligenz

Part of the book series: Informatik-Fachberichte ((2252,volume 202))

  • 67 Accesses

Abstract

Constraint propagation subsumes all techniques that, given initial values for some variables, draw inferences about the values of all variables by repeatedly propagating restrictions imposed by one constraint to connected constraints. Solving a constraint problem means to find an assignment of values for the variables that satisfy all constraints and is compatible with the initialization. A more general Problem is constraint satisfaction where constraints may be withdrawn in order to find a Solution for the remaining constraints.The contributions of Angi Voβ were partially supported by the Deutsche Forschungsgemeinschaft DFG as part of the research project SFB 314 “Künstliche Intelligenz und Wissensbasierte Systeme”. The contributions of Hans voβ were partially supported by the Bundesminister für Forschung und Technologie under contract ITW 85030.

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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.

Literature

  1. Artificial Intelligence (1984), Vol.24, Numbers 1–3, Special Volume on Qualitiative Reasoning about Physical Systems.

    Google Scholar 

  2. Allen, J. F. : Maintaining Knowledge about Temporal Intervals. CACM, Vol.26, No.11, pp. 832–843.

    Google Scholar 

  3. Allen, J. F. : Towards a General Theory of Action and Time. Artificial Intelligence, Vol.23, pp. 123–154.

    Google Scholar 

  4. Davis, R. : Diagnostic Reasoning Based on Structure and Behavior. in [AI-Journal 84], pp. 347–410.

    Google Scholar 

  5. deKleer, J., Brown, J. S. : A Qualitative Physics Based on Confluences. in [AI-Journal 84], pp. 7–83.

    Google Scholar 

  6. Descotte, Y., Latombe, J. C. : Making Compromises among Antagonist Constraints in a Planner. Artificial Intelligence, Vol.27, No.2, pp. 183–217.

    Google Scholar 

  7. Fox, M. S., Allen, B. P., Smith, S. F., Strohm, G. A. : ISIS -A Constraint Directed Reasoning Approach to Job Shop Scheduling. CMU-RI-83-3, The Robotics Institute, Carnegie-Mellon University, Pittsburgh, 1983.

    Google Scholar 

  8. Freuder, E. C. : Synthesizing Constraint Expressions. Communications Of the ACM, Vol.21, No.11, pp.958–966.

    Google Scholar 

  9. Gaschnig, J. G. : Performance Measurement and Analysis of Certain Search Algorithms. PhD Thesis, Carnegie-Mellon University, Pittsburgh, 1979.

    Google Scholar 

  10. Gosling, J. : Algebraic Constraints. CMU-CS-83-132, Dep. of Computer Science, Carnegie-Mellon University, May 1983.

    Google Scholar 

  11. Kornfeld, W. A. : The Use of Parallelism to Implement a Heuristic Search. Proc. 7th IJCAI, 1981.

    Google Scholar 

  12. Mackworth, A. K. : Consistency in Networks of Relations. Artificial Intelligence 8, pp. 99–118, 1977.

    Article  MATH  Google Scholar 

  13. Mackworth, A. K., Freuder, E. : The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems. Artificial intelligence 25, p. 65, 1985.

    Article  Google Scholar 

  14. McAllester, D. A. : An Outlook on Truth Maintenance. AI-Lab Memo 551, AI-Lab, Massachusets Institute of Technology, Cambridge, 1980.

    Google Scholar 

  15. Montanari, U. : Networks of Constraints: Formal Properties and Applications to Picture Processing. Information Sciences 7, pp. 95–132, 1974.

    Article  MathSciNet  Google Scholar 

  16. Nudel, B. : Consistent Labelling Problems and their Algorithms: Expected Complexities and Theory-Based Heuristics. Artificial Intelligence 21, 1983.

    Google Scholar 

  17. Reinfrank, M. T. : SCENELAB, Scene Labelling by a Society of Agents. A Distributed Constraint Propagation System., Memo SEKI-85-06, Fachbereich Informatik, Universität Kaiserslautern.

    Google Scholar 

  18. Rosenfeld, A., Hummel, R. A., Zucker, S. : Scene Labelling by Relaxation Operations. IEEE Transactions on SMC 6(6), 1976.

    Google Scholar 

  19. Stallman, R. M.; Sussman, G. J. : Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis, Artificial Intelligence Vol.9, pp.135–196.

    Google Scholar 

  20. Steele, G. L. Jr.: The Definition and Implementation of a Computer Programming Language Based on Constraints, MIT AILab., AI-TR-595.

    Google Scholar 

  21. Steels, L. : Constraints as Consultants. ECAI 1984, pp. 75–78.

    Google Scholar 

  22. Stoyan, Herbert : Rechnen mit Relationen, Universität Erlangen, Manuskript.

    Google Scholar 

  23. Sussman, G., Steele, G. L. Jr. : CONSTRAINTS -a Language for Expressing Almost-Hierarchical Descriptions. Artificial Intelligence 14, pp. 1–40.

    Google Scholar 

  24. Waltz, D. : Understanding Line Drawings of Scenes with Shadows. in ’The Psychology of Computer Vision», P. H. Winston (ed.), McGraw-Hill Book Company 1975, pp. 19–91.

    Google Scholar 

  25. Williams, B. C. : Qualitative Analysis of MOS Circuits. in [AI-Journal 84], pp. 281–346.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für angewandte Informationstechnik, Forschungsgruppe Expertensysteme, GMD Schloβ Birlinghoven, Postfach 1240, D-5205, St. Augustin 1, Deutschland

    Angelika Voβ & Hans Voβ

Authors
  1. Angelika Voβ
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hans Voβ
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Gesellschaft für Mathematik und Datenverarbeitung, Forschungsgruppe Expertensysteme, Postfach 12 40, D-5205, St. Augustin, Deutschland

    Thomas Christaller

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Voβ, A., Voβ, H. (1989). Formalizing Local Constraint Propagation Methods. In: Christaller, T. (eds) Künstliche Intelligenz. Informatik-Fachberichte, vol 202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83739-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-83739-5_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50884-7

  • Online ISBN: 978-3-642-83739-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation