Skip to main content
SpringerLink
Log in

Robustness, stability, recoverability, and reliability in constraint satisfaction problems

  • Regular Paper
  • Published:
Knowledge and Information Systems Aims and scope Submit manuscript

Abstract

Many real-world problems in Artificial Intelligence (AI) as well as in other areas of computer science and engineering can be efficiently modeled and solved using constraint programming techniques. In many real-world scenarios the problem is partially known, imprecise and dynamic such that some effects of actions are undesired and/or several unforeseen incidences or changes can occur. Whereas expressivity, efficiency, and optimality have been the typical goals in the area, there are several issues regarding robustness that have a clear relevance in dynamic Constraint Satisfaction Problems (CSPs). However, there is still no clear and common definition of robustness-related concepts in CSPs. In this paper, we propose two clearly differentiated definitions for robustness and stability in CSP solutions. We also introduce the concepts of recoverability and reliability, which arise in temporal CSPs. All these definitions are based on related well-known concepts, which are addressed in engineering and other related areas.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Abril M, Barber F, Ingolotti L, Salido MA, Tormos P, Lova A (2008) An assessment of railway capacity. Transp Res Part E 44(5):774–806

    Article  Google Scholar 

  2. Barber F (2000) Reasoning on intervals and point-based disjunctive metric constraints in temporal contexts. J Artif Intell Res 12:35–86

    MathSciNet  MATH  Google Scholar 

  3. Bartak R, Salido MA (2011) Constraint satisfaction for planning and scheduling problems. Constraints 16(3):223–227

    Article  MathSciNet  Google Scholar 

  4. Bertsimas D, Sim M (2004) The price of robustness. Oper Res 52(1):35–53

    Article  MathSciNet  MATH  Google Scholar 

  5. Climent L, Wallace R, Salido M, Barber F (2013) Modeling robustness in CSPS as weighted CSPS. In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems CPAIOR 2013, pp 44–60

  6. Climent L, Wallace R, Salido M, Barber F (2014) Robustness and stability in constraint programming under dynamism and uncertainty. J Artif Intell Res 49(1):49–78

    MathSciNet  MATH  Google Scholar 

  7. Dechter R (1991) Temporal constraint network. Artif Intell 49:61–295

    Article  MathSciNet  MATH  Google Scholar 

  8. Hazewinkel M (2002) Encyclopaedia of mathematics. Springer, New York

    Google Scholar 

  9. Hebrard E (2007) Robust solutions for constraint satisfaction and optimisation under uncertainty. PhD thesis, University of New South Wales

  10. Hebrard E, Hnich B, Walsh T (2004) Super solutions in constraint programming. In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CPAIOR-04), pp 157–172

  11. Jen E (2003) Stable or robust? What’s the difference? Complexity 8(3):12–18

    Article  MathSciNet  Google Scholar 

  12. Kitano H (2007) Towards a theory of biological robustness. Mol Syst Biol 3(137)

  13. Liebchen C, Lbbecke M, Mhring R, Stiller S (2009) The concept of recoverable robustness, linear programming recovery, and railway applications. In: LNCS, vol 5868

  14. Papapetrou P, Kollios G, Sclaroff S, Gunopulos D (2009) Mining frequent arrangements of temporal intervals. Knowl Inf Syst 21:133–171

    Article  Google Scholar 

  15. Rizk A, Batt G, Fages F, Solima S (2009) A general computational method for robustness analysis with applications to synthetic gene networks. Bioinformatics 25(12):168–179

    Article  Google Scholar 

  16. Rossi F, van Beek P, Walsh T (2006) Handbook of constraint programming. Elsevier, New York

    MATH  Google Scholar 

  17. Roy B (2010) Robustness in operational research and decision aiding: a multi-faceted issue. Eur J Oper Res 200:629–638

    Article  MATH  Google Scholar 

  18. Szathmary E (2006) A robust approach. Nature 439:19–20

    Article  Google Scholar 

  19. Verfaillie G, Schiex T (1994) Solution reuse in dynamic constraint satisfaction problems. In: Proceedings of the 12th national conference on artificial intelligence (AAAI-94), pp 307–312

  20. Wallace R, Grimes D, Freuder E (2009) Solving dynamic constraint satisfaction problems by identifying stable features. In: Proceedings of international joint conferences on artificial intelligence (IJCAI-09), pp 621–627

  21. Wang D, Tse Q, Zhou Y (2011) A decentralized search engine for dynamic web communities. Knowl Inf Syst 26(1):105–125

    Article  Google Scholar 

  22. Wiggins S (1990) Introduction to applied nonlinear dynamical systems and chaos. Springer, New York

    Book  MATH  Google Scholar 

  23. Zhou Y, Croft W (2008) Measuring ranked list robustness for query performance prediction. Knowl Inf Syst 16:155–171

    Article  Google Scholar 

Download references

Acknowledgments

This work has been partially supported by the research project TIN2013-46511-C2-1 (MINECO, Spain). We would also thank the reviewers for their efforts and helpful comments.

Author information

Authors and Affiliations

  1. Instituto de Automática e Informática Industrial, Universitat Politècnica de València, Valencia, Spain

    Federico Barber & Miguel A. Salido

Authors
  1. Federico Barber
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Miguel A. Salido
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Federico Barber.

Electronic supplementary material

Below is the link to the electronic supplementary material.

ESM 1 (RAR 3,317 kb)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Barber, F., Salido, M.A. Robustness, stability, recoverability, and reliability in constraint satisfaction problems. Knowl Inf Syst 44, 719–734 (2015). https://doi.org/10.1007/s10115-014-0778-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10115-014-0778-3

Keywords

Search

Navigation