Skip to main content
SpringerLink
Log in

Opportunistic Specialization in Russian Doll Search

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming - CP 2002 (CP 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2470))

Abstract

Russian Doll Search (RDS) is a clever procedure to solve overconstrained problems. RDS solves a sequence of nested subproblems, each including one more variable than the previous, until the whole problem is solved. Specialized RDS (SRDS) solves each subproblem for every value of the new variable. SRDS lower bound is better than RDS lower bound, causing a higher efficiency. A natural extension is Full Specialized RDS (FSRDS), which solves each subproblem for every value of every variable. Although FSRDS lower bound is better than the SRDS one, the extra work performed by FSRDS renders it inefficient. However, much of the useless work can be avoided. With this aim, we present Opportunistic Specialization in RDS (OSRDS), an algorithm that lies between SRDS and FSRDS. In addition to specialize the values of one variable, OSRDS specializes some values of other variables that look promising to increase the lower bound in the current distribution of inconsistency counts. Experimental results on random and real problems show the benefits of this approach.

The first two authors were supported by the IST Programme of the Commission of the European Union through the ECSPLAIN project (IST-1999-11969), and by the Spanish CICYT project TAP99-1086-C03-02.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. M. S. Affane and H. Bennaceur. A weighted arc consistency technique for Max-CSP. In Proc. of the 13th ECAI, 209–213, 1998.

    Google Scholar 

  2. S. Bistarelli, U. Montanari and F. Rossi. Constraint Solving over Semirings. In Proc. of the 14 th IJCAI, 1995.

    Google Scholar 

  3. S. Bistarelli, U. Montanari, F. Rossi, T. Schiex, G. Verfaillie and H. Fargier. Semiring-based CSPs and Valued CSPs: Frameworks, Properties and Comparison. Constraints, 4:199–240, 1999.

    Article  MathSciNet  MATH  Google Scholar 

  4. B. Cabon, S. De Givry, L. Lobjois, T. Schiex and J.P. Warners. Radio Link Frequency Assignment Constraints, vol. 4, num. 1, 79–89, 1999.

    Article  MATH  Google Scholar 

  5. R. Dechter. Mini-buckets: A general scheme for generating approximations in automated reasoning. Artificial Intelligence, 113:41–85, 1999.

    Article  MathSciNet  MATH  Google Scholar 

  6. R. Dechter. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, 113:41–85, 1999.

    Article  MathSciNet  MATH  Google Scholar 

  7. E. C. Freuder and R. J. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58:21–70, 1992.

    Article  MathSciNet  Google Scholar 

  8. J. Larrosa. Boosting search with variable elimination. In Proc. of the 6 th CP, 291–305, 2000.

    Google Scholar 

  9. J. Larrosa. Node and arc consistency in Weighted CSP. In Proc. of the 18 th AAAI, 2002.

    Google Scholar 

  10. J. Larrosa and P. Meseguer. Exploiting the use of DAC in Max-CSP. In Proc. of the 2 th CP, 308–322, 1996.

    Google Scholar 

  11. J. Larrosa, P. Meseguer, and T. Schiex. Maintaining reversible DAC for Max-CSP. Artificial Intelligence, 107:149–163, 1999.

    Article  MathSciNet  MATH  Google Scholar 

  12. P. Meseguer, M. Sanchez. Specializing russian doll search. In Proc. of the 7 th CP, 464–478, 2001.

    Google Scholar 

  13. T. Schiex, H. Fargier and G. Verfaillie. Valued Constraint Satisfaction Problems: hard and easy problems. In Proc. of the 14 th IJCAI, 631–637, 1995.

    Google Scholar 

  14. T. Schiex. Arc consistency for soft constraints In Proc. of the 6 th CP, 411–424, 2000.

    Google Scholar 

  15. G. Verfaillie, M. Lemaître, and T. Schiex. Russian doll search. In Proc. of the 13 th AAAI, 181–187, 1996.

    Google Scholar 

  16. R. Wallace. Directed arc consistency preprocessing. In M. Meyer, editor, Selected papers from the ECAI-94 Workshop on Constraint Processing, number 923 in LNCS, 121–137. Springer, Berlin, 1995.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IIIA-CSIC, Campus UAB, 08193, Bellaterra, Spain

    Pedro Mesegue & Martí Sánchez

  2. ONERA, 2 av. Edouard Belin, BP 4025, 31055, Toulouse Cedex, France

    Gérard Verfaillie

Authors
  1. Pedro Mesegue
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martí Sánchez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gérard Verfaillie
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Brown University, Box 1910, Providence, RI, 02912, USA

    Pascal Van Hentenryck

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mesegue, P., Sánchez, M., Verfaillie, G. (2002). Opportunistic Specialization in Russian Doll Search. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-46135-3_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44120-5

  • Online ISBN: 978-3-540-46135-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation