Skip to main content

Relaxing constraint networks to resolve inconsistencies

  • Conference paper
Book cover Künstliche Intelligenz

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

Abstract

This paper deals with the following problem: What is to do if a constraint problem is inconsistent but one wants to solve it anyway? Concentrating at locally consistent solutions, it answers the questions: What is a relaxation of a constraint problem? Do solutions of relaxed problems lead to a solution of the original one? Does a locally consistent relaxation always exist? How to obtain such a relaxation efficiently? As an answer to the last question, we present an algorithm which has been implemented as an extension of the CONSAT constraint system.

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

Access this chapter

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.

References

  1. Davis, R.: Diagnostic reasoning based on structure and behavior. Art. Int., 24 (1984), 347

    Article  Google Scholar 

  2. Dechter, R./Pearl, J.: Network-based heuristics for constraint satisfaction problems. Art. Int., 34 (1988), 1

    Article  MathSciNet  Google Scholar 

  3. Descotte, Y./ Latombe, J.-C.: Making compromises among antagonist constraints in a planner. Art. Int., 27 (1985), 183

    Article  Google Scholar 

  4. Fidelak, M./ Güsgen, H.-W.: Improving local constraint propagation. TEX-B Memo 31–88, 1988

    Google Scholar 

  5. Güsgen, H.-W.: CONS AT: Foundations of a system for constraint satisfaction. In: Früchtenicht, H. W. et al. (eds.): Technische Expertensysteme: Wissensrepräsentation und Schlußfolgerungsverfahren. Munich (Oldenbourg), 1988,415

    Google Scholar 

  6. Güsgen, H.-W./ Hertzberg, J.: Some fundamental properties of local constraint propagation. To appear as Research Note in: Art. Int. (1988)

    Google Scholar 

  7. Hertzberg, J./ Güsgen, H.-W./ Voß, A./ Fidelak, M./ Voß, H.: Relaxing constraint networks to resolve inconsistencies. In: Hertzberg, J./ Günter, A. (eds.): Beiträge zum 2. Workshop Planen und Konfigurieren. Arbeitspapiere der GMD 310,1988

    Google Scholar 

  8. Marcus, S./ Stout, J./ McDermott, J.: VT: An expert elevator designer that uses knowledge-based backtracking. AI Magazine, 9 (1988), 95

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hertzberg, J., Güsgen, HW., Voβ, A., Fidelak, M., Voβ, H. (1988). Relaxing constraint networks to resolve inconsistencies. In: Hoeppner, W. (eds) Künstliche Intelligenz. Informatik-Fachberichte, vol 181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-74064-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-74064-0_6

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics