Advertisement

Generalized Constraint Acquisition

  • Xuan-Ha Vu
  • Barry O’Sullivan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4612)

Abstract

Constraint programming is an approach to problem solving that relies on a combination of inference and search to solve real-world problems formulated as constraint satisfaction problems (CSPs). Many methods for solving CSPs have been developed. However, the specification of a CSP is sometimes not available, but may have to be learned from a training set, which is given, for instance, as a set of examples of its solutions and non-solutions. The motivating applications for constraint acquisition are many. For example, often one may wish to find a compact representation of a CSP instance for purposes such as explanation generation, requirements gathering, and specification. Acquiring soft constraints, which we focus on here, can be regarded as learning about preferences, uncertainty or costs in a combinatorial setting.

References

  1. 1.
    Coletta, R., Bessiere, C., O’Sullivan, B., Freuder, E.C., O’Connell, S., Quinqueton, J.: Constraint Acquisition as Semi-Automatic Modeling. In: Gedeon, T.D., Fung, L.C.C. (eds.) AI 2003. LNCS (LNAI), vol. 2903, pp. 111–124. Springer, Heidelberg (2003)Google Scholar
  2. 2.
    Mitchell, T.M.: Generalization as Search. Artificial Intell. 18(2), 203–226 (1982)CrossRefGoogle Scholar
  3. 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)Google Scholar
  4. 4.
    Bessiere, C., Coletta, R., Koriche, F., O’Sullivan, B.: A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 23–34. Springer, Heidelberg (2006)Google Scholar
  5. 5.
    Bistarelli, S., Montanari, U., Rossi, F.: Constraint solving over semirings. In: IJCAI (1), pp. 624–630 (1995)Google Scholar
  6. 6.
    Bistarelli, S., Montanari, U., Rossi, F.: Semiring-Based Constraint Satisfaction and Optimization. Journal of the ACM 44(2), 201–236 (1997)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Xuan-Ha Vu
    • 1
  • Barry O’Sullivan
    • 1
  1. 1.Cork Constraint Computation Centre, Department of Computer Science, University College CorkIreland

Personalised recommendations