Skip to main content

Time-Bounded Query Generator for Constraint Acquisition

  • Conference paper
  • First Online:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2018)

Abstract

QuAcq is a constraint acquisition algorithm that assists a non-expert user to model her problem as a constraint network. QuAcq generates queries as examples to be classified as positive or negative. One of the drawbacks of QuAcq is that generating queries can be time-consuming. In this paper we present Tq-gen, a time-bounded query generator. Tq-gen is able to generate a query in a bounded amount of time. We rewrite QuAcq to incorporate the Tq-gen generator. This leads to a new algorithm called T-quacq. We propose several strategies to make T-quacq efficient. Our experimental analysis shows that thanks to the use of Tq-gen, T-quacq dramatically improves the basic QuAcq in terms of time consumption, and sometimes also in terms of number of queries.

This work was supported by Scholarship No. 7587 of the EU METALIC non redundant program.

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

Notes

  1. 1.

    QuAcq also contains a line for returning “collapse” when detecting an inconsistent learned network. This line has been dropped from T-quacq because we allow it to learn a target network without solutions.

  2. 2.

    www.choco-solver.org.

References

  1. Arcangioli, R., Bessiere, C., Lazaar, N.: Multiple constraint acquisition. In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, pp. 698–704 (2016)

    Google Scholar 

  2. Beldiceanu, N., Simonis, H.: A model seeker: extracting global constraint models from positive examples. In: Milano, M. (ed.) CP 2012. LNCS, pp. 141–157. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33558-7_13

    Chapter  Google Scholar 

  3. Bessiere, C., Coletta, R., Hebrard, E., Katsirelos, G., Lazaar, N., Narodytska, N., Quimper, C., Walsh, T.: Constraint acquisition via partial queries. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence, IJCAI 2013, Beijing, China, pp. 475–481 (2013)

    Google Scholar 

  4. Bessiere, C., Coletta, R., O’Sullivan, B., Paulin, M.: Query-driven constraint acquisition. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence, IJCAI 2007, Hyderabad, India, pp. 50–55 (2007)

    Google Scholar 

  5. Bessiere, C., et al.: New approaches to constraint acquisition. In: Bessiere, C., De Raedt, L., Kotthoff, L., Nijssen, S., O’Sullivan, B., Pedreschi, D. (eds.) Data Mining and Constraint Programming. LNCS (LNAI), vol. 10101, pp. 51–76. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-50137-6_3

    Chapter  Google Scholar 

  6. Bessiere, C., Lazaar, N., Koriche, F., O’Sullivan, B.: Constraint acquisition. In: Artificial Intelligence (2017, in Press)

    Article  MathSciNet  Google Scholar 

  7. Freuder, E.C., Wallace, R.J.: Suggestion strategies for constraint-based matchmaker agents. Int. J. Artif. Intell. Tools 11(1), 3–18 (2002)

    Article  Google Scholar 

  8. Jefferson, C., Akgun, O.: CSPLib: a problem library for constraints (1999). http://www.csplib.org

  9. Lallemand, C., Gronier, G.: Enhancing user experience during waiting time in HCI: contributions of cognitive psychology. In: Proceedings of the Designing Interactive Systems Conference, DIS 2012, pp. 751–760. ACM, New York (2012). https://doi.org/10.1145/2317956.2318069

  10. Lallouet, A., Lopez, M., Martin, L., Vrain, C.: On learning constraint problems. In: Proceedings of the 22nd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2010, Arras, France, pp. 45–52 (2010)

    Google Scholar 

  11. Petrie, K.E., Smith, B.M.: Symmetry breaking in graceful graphs. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 930–934. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-45193-8_81

    Chapter  Google Scholar 

  12. Shchekotykhin, K.M., Friedrich, G.: Argumentation based constraint acquisition. In: Proceedings of the Ninth IEEE International Conference on Data Mining, ICDM 2009, Miami, FL, pp. 476–482 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nadjib Lazaar .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ait Addi, H., Bessiere, C., Ezzahir, R., Lazaar, N. (2018). Time-Bounded Query Generator for Constraint Acquisition. In: van Hoeve, WJ. (eds) Integration of Constraint Programming, Artificial Intelligence, and Operations Research. CPAIOR 2018. Lecture Notes in Computer Science(), vol 10848. Springer, Cham. https://doi.org/10.1007/978-3-319-93031-2_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-93031-2_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-93030-5

  • Online ISBN: 978-3-319-93031-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics