Skip to main content
SpringerLink
Log in

Structure-Driven Multiple Constraint Acquisition

  • Conference paper
  • First Online:
Book cover Principles and Practice of Constraint Programming (CP 2019)

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

Abstract

MQuAcq is an algorithm for active constraint acquisition that has been shown to outperform previous algorithms such as QuAcq and MultiAcq. In this paper, we exhibit two important drawbacks of MQuAcq. First, for each negative example, the number of recursive calls to the main procedure of MQuAcq can be non-linear, making it impractical for large problems. Second, MQuAcq, as well as QuAcq and MultiAcq, does not take into account the structure of the learned problem. We propose MQuAcq-2, a new algorithm based on MQuAcq that integrates solutions to both these problems. MQuAcq-2 exploits the structure of the learned problem by focusing the queries it generates to quasi-cliques of constraints. When dealing with a negative query, it only requires a linear number of iterations. MQuAcq-2 outperforms MQuAcq, especially on large problems.

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 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

References

  1. Bessiere, C., Koriche, F., Lazaar, N., O’Sullivan, B.: Constraint acquisition. Artif. Intell. 244, 315–342 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  2. 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 

  3. Bessiere, C., Coletta, R., Freuder, E.C., O’Sullivan, B.: Leveraging the learning power of examples in automated constraint acquisition. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 123–137. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-30201-8_12

    Chapter  MATH  Google Scholar 

  4. Bessiere, C., Coletta, R., Koriche, F., O’Sullivan, B.: A SAT-based version space algorithm for acquiring constraint satisfaction problems. In: Gama, J., Camacho, R., Brazdil, P.B., Jorge, A.M., Torgo, L. (eds.) ECML 2005. LNCS (LNAI), vol. 3720, pp. 23–34. Springer, Heidelberg (2005). https://doi.org/10.1007/11564096_8

    Chapter  Google Scholar 

  5. Lallouet, A., Lopez, M., Martin, L., Vrain, C.: On learning constraint problems. In: 22nd IEEE International Conference on Tools with Artificial Intelligence (ICTAI), vol. 1, pp. 45–52. IEEE (2010)

    Google Scholar 

  6. 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 

  7. Bshouty, N.: Exact learning boolean functions via the monotone theory. Inf. Comput. 123(1), 146–153 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  8. Bshouty, N.H.: Exact learning from an honest teacher that answers membership queries. Theor. Comput. Sci. 733, 4–43 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  9. Angluin, D.: Queries and concept learning. Mach. Learn. 2(4), 319–342 (1988)

    MathSciNet  Google Scholar 

  10. Bessiere, C., Coletta, R., O’Sullivan, B., Paulin, M., et al.: Query-driven constraint acquisition. In: International Joint Conference on Artificial Intelligence (IJCAI), vol. 7, pp. 50–55 (2007)

    Google Scholar 

  11. Shchekotykhin, K., Friedrich, G.: Argumentation based constraint acquisition. In: Ninth IEEE International Conference on Data Mining, pp. 476–482. IEEE (2009)

    Google Scholar 

  12. Bessiere, C., et al.: Constraint acquisition via partial queries. In: International Joint Conference on Artificial Intelligence (IJCAI), vol. 13, pp. 475–481 (2013)

    Google Scholar 

  13. Freuder, E.C., Wallace, R.J.: Suggestion strategies for constraint-based matchmaker agents. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 192–204. Springer, Heidelberg (1998). https://doi.org/10.1007/3-540-49481-2_15

    Chapter  Google Scholar 

  14. Daoudi, A., Mechqrane, Y., Bessiere, C., Lazaar, N., Bouyakhf, E.H.: Constraint acquisition using recommendation queries. In: International Joint Conference on Artificial Intelligence (IJCAI), pp. 720–726 (2016)

    Google Scholar 

  15. Bessiere, C., Coletta, R., Daoudi, A., Lazaar, N., Mechqrane, Y., Bouyakhf, E.H.: Boosting constraint acquisition via generalization queries. In: European Conference on Artificial Intelligence (ECAI), pp. 99–104 (2014)

    Google Scholar 

  16. Arcangioli, R., Bessiere, C., Lazaar, N.: Multiple constraint aquisition. In: International Joint Conference on Artificial Intelligence (IJCAI), pp. 698–704 (2016)

    Google Scholar 

  17. Tsouros, D.C., Stergiou, K., Sarigiannidis, P.G.: Efficient methods for constraint acquisition. In: 24th International Conference on Principles and Practice of Constraint Programming (2018)

    Google Scholar 

  18. Daoudi, A., Lazaar, N., Mechqrane, Y., Bessiere, C., Bouyakhf, E.H.: Detecting types of variables for generalization in constraint acquisition. In: 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 413–420. IEEE (2015)

    Google Scholar 

  19. Pardalos, J., Resende, M.: On maximum clique problems in very large graphs. DIMACS Ser. 50, 119–130 (1999)

    MathSciNet  MATH  Google Scholar 

  20. Abello, J., Resende, M.G.C., Sudarsky, S.: Massive quasi-clique detection. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 598–612. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45995-2_51

    Chapter  Google Scholar 

  21. Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575–577 (1973)

    Article  MATH  Google Scholar 

  22. Gibson, D., Kumar, R., Tomkins, A.: Discovering large dense subgraphs in massive graphs. In: Proceedings of the 31st International Conference on Very large data bases, VLDB Endowment, pp. 721–732 (2005)

    Google Scholar 

  23. Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Nat. Acad. Sci. 99(12), 7821–7826 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  24. Newman, M.E.: Modularity and community structure in networks. Proc. Nat. Acad. Sci. 103(23), 8577–8582 (2006)

    Article  Google Scholar 

  25. Papadopoulos, S., Kompatsiaris, Y., Vakali, A., Spyridonos, P.: Community detection in social media. Data Min. Knowl. Disc. 24(3), 515–554 (2012)

    Article  Google Scholar 

  26. Adamic, L.A., Adar, E.: Friends and neighbors on the web. Soc. Netw. 25(3), 211–230 (2003)

    Article  Google Scholar 

  27. Leicht, E.A., Holme, P., Newman, M.E.: Vertex similarity in networks. Phys. Rev. E 73(2), 026120 (2006)

    Article  Google Scholar 

  28. Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. J. Am. Soc. Inform. Sci. Technol. 58(7), 1019–1031 (2007)

    Article  Google Scholar 

  29. Cabon, B., De Givry, S., Lobjois, L., Schiex, T., Warners, J.P.: Radio link frequency assignment. Constraints 4(1), 79–89 (1999)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics and Telecommunications Engineering, University of Western Macedonia, Kozani, Greece

    Dimosthenis C. Tsouros & Kostas Stergiou

  2. CNRS, University of Montpellier, Montpellier, France

    Christian Bessiere

Authors
  1. Dimosthenis C. Tsouros
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kostas Stergiou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christian Bessiere
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dimosthenis C. Tsouros .

Editor information

Editors and Affiliations

  1. INRA, Castanet Tolosan, France

    Thomas Schiex

  2. INRA, Castanet Tolosan, France

    Simon de Givry

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Tsouros, D.C., Stergiou, K., Bessiere, C. (2019). Structure-Driven Multiple Constraint Acquisition. In: Schiex, T., de Givry, S. (eds) Principles and Practice of Constraint Programming. CP 2019. Lecture Notes in Computer Science(), vol 11802. Springer, Cham. https://doi.org/10.1007/978-3-030-30048-7_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-30048-7_41

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-30047-0

  • Online ISBN: 978-3-030-30048-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation