Skip to main content
SpringerLink
Log in

Cost-Driven Interactive CSP with Constraint Relaxation

  • Conference paper
Principles and Practice of Constraint Programming - CP 2009 (CP 2009)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5732))

Abstract

We revisit the Interactive CSP framework (ICSP) and propose a new, somewhat more general model, which we call Cost-Driven Interactive CSP (CICSP). First, we extend the value acquisition by a more general concept of constraint relaxation. Second, we loosen the basic assumption of ICSP that “value acquisition is expensive” by introducing external cost functions of the constraint relaxation and the constraint propagation effort. We also propose a general Interactive Relaxation algorithm template that is designated for CICSP. The effectiveness of this approach is illustrated on a real-life scenario from the Functional Test Generation problem domain.

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. Adir, A., Emek, R., Katz, Y., Koyfman, A.: DeepTrans — a model-based approach to functional verification of address translation mechanisms. In: Proc. 4th Internat. Worksh. on Microprocessor Test and Verification: Common Challenges and Solutions, pp. 3–6. IEEE CS Press, Los Alamitos (2003)

    Chapter  Google Scholar 

  2. Barruffi, R., Lamma, E., Mello, P., Milano, M.: Least commitment on variable binding in presence of incomplete knowledge. In: Biundo, S., Fox, M. (eds.) ECP 1999. LNCS, vol. 1809, pp. 159–171. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  3. Cucchiara, R., Gavanelli, M., Lamma, E., Mello, P., Milano, M., Piccardi, M.: Constraint propagation and value acquisition: Why we should do it interactively. In: Proc. 16th Internat. Joint Conf. on Artif. Intell., Stockholm, pp. 468–477 (1999)

    Google Scholar 

  4. Dechter, R.: On the expressiveness of networks with hidden variables. In: Proc. 8th National Conf. on Artif. Intell., Boston, pp. 556–562 (1990)

    Google Scholar 

  5. Dechter, R., Dechter, A.: Belief maintenance in dynamic constraint networks. In: Proc. 7th National Conf. on Artif. Intell., St. Paul, pp. 37–42 (1988)

    Google Scholar 

  6. Faltings, B.: Distributed constraint programming. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, ch. 20, pp. 699–729. Elsevier, Amsterdam (2006)

    Chapter  Google Scholar 

  7. Faltings, B., Macho-González, S.: Open constraint programming. Artif. Intell. 161(1-2), 181–208 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Ferguson, A., O’Sullivan, B.: Quantified constraint satisfaction problems: from relaxations to explanations. In: Proc. Internat. Joint Conf. on Artif. Intell (IJCAI), pp. 74–79. Morgan Kaufmann, San Francisco (2007)

    Google Scholar 

  9. Gutkovich, B., Moss, A.: CP with architectural state lookup for functional test generation. In: 11th Annu. IEEE Internat. Worksh. on High Level Design Validation and Test, pp. 111–118 (2006)

    Google Scholar 

  10. ILOG Solver 6.5 reference manual (October 2007)

    Google Scholar 

  11. Intel® 64 and IA-32 architectures software developer’s manual (February 2008)

    Google Scholar 

  12. Jussien, N., Boizumault, P.: Implementing constraint relaxation over finite domains using ATMS. In: Jampel, M., Maher, M.J., Freuder, E.C. (eds.) CP-WS 1995. LNCS, vol. 1106, pp. 265–280. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  13. Macho-González, S., Ansótegui, C., Meseguer, P.: Boosting open CSPs. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 314–328. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  14. Macho-González, S., Meseguer, P.: Open, Interactive and Dynamic CSP. In: Proc. Internat. Worksh. on Constraint Solving under Change and Uncertainty (CP 2005), pp. 13–17 (2005)

    Google Scholar 

  15. Moss, A.: Constraint patterns and search procedures for CP-based random test generation. In: Yorav, K. (ed.) HVC 2007. LNCS, vol. 4899, pp. 86–103. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Naveh, Y., Rimon, M., Jaeger, I., Katz, Y., Vinov, M., Marcus, E., Shurek, G.: Constraint-based random stimuli generation for hardware verification. AI Magazine 28(3), 13–30 (2007)

    Google Scholar 

  17. Papadopoulos, A., O’Sullivan, B.: Relaxations for compiled over-constrained problems. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 433–447. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  18. Schiex, T., Fargier, H., Verfaillie, G.: Valued constraint satisfaction problems: Hard and easy problems. In: Proc. Internat. Joint Conf. on Artif. Intell (IJCAI), Montreal, pp. 631–637 (1995)

    Google Scholar 

  19. Sergot, M.: A query-the-user facility for logic programming. In: Degano, P., Sandewall, E. (eds.) Integrated Interactive Computing Systems, pp. 27–41. North-Holland, Amsterdam (1983)

    Google Scholar 

  20. Verfaillie, G., Jussien, N.: Constraint solving in uncertain and dynamic environments: A survey. Constraints 10(33), 253–281 (2005)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Intel Corporation, Haifa, Israel

    Yevgeny Schreiber

Authors
  1. Yevgeny Schreiber
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, University of St. Andrews, North Haugh, St Andrews, KY16 9SX, Fife, Scotland, UK

    Ian P. Gent

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schreiber, Y. (2009). Cost-Driven Interactive CSP with Constraint Relaxation. In: Gent, I.P. (eds) Principles and Practice of Constraint Programming - CP 2009. CP 2009. Lecture Notes in Computer Science, vol 5732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04244-7_55

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04244-7_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04243-0

  • Online ISBN: 978-3-642-04244-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation