Skip to main content
SpringerLink
Log in

Towards Inductive Constraint Solving

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming — CP 2001 (CP 2001)

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

Abstract

A difficulty that arises frequently when writing a constraint solver is to determine the constraint propagation and simplification algorithm. In previous work, different methods for automatic generation of propagation rules [5],[17],[3] and simplification rules [4] for constraints defined over finite domains have been proposed. In this paper, we present a method for generating rule-based solvers for constraint predicates defined by means of a constraint logic program, even when the constraint domain is infinite. This approach can be seen as a concrete step towards Inductive Constraint Solving.

The research reported in this paper has been supported by the Bavarian-French Hochschulzentrum.

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. S. Abdennadher. Operational semantics and confluence of constraint propagation rules. In Proc. of the third International Conference on Principles and Practice of Constraint Programming, CP’97, LNCS 1330, pages 252–266. Springer-Verlag, November 1997.

    Google Scholar 

  2. S. Abdennadher, T. Frühwirth, and H. Meuss. Confluence and semantics of constraint simplification rules. Constraints Journal, Special Issue on the Second International Conference on Principles and Practice of Constraint Programming, 4(2):133–165, May 1999.

    Google Scholar 

  3. S. Abdennadher and C. Rigotti. Automatic generation of propagation rules for finite domains. In Proc. of the 6th International Conference on Principles and Practice of Constraint Programming, CP’00, LNCS 1894, pages 18–34. Springer-Verlag, September 2000.

    MATH  Google Scholar 

  4. S. Abdennadher and C. Rigotti. Using confluence to generate rule-based constraint solvers. In Proc. of the third International Conference on Principles and Practice of Declarative Programming. ACM Press, September 2001. To appear.

    Google Scholar 

  5. K. Apt and E. Monfroy. Automatic generation of constraint propagation algorithms for small finite domains. In Proc. of the 5th International Conference on Principles and Practice of Constraint Programming, CP’99, LNCS 1713, pages 58–72. Springer-Verlag, October 1999.

    MATH  Google Scholar 

  6. T. Frühwirth. Theory and practice of constraint handling rules, special issue on constraint logic programming. Journal of Logic Programming, 37(1–3):95–138, October 1998.

    Article  MathSciNet  Google Scholar 

  7. T. Frühwirth. Proving termination of constraint solver programs. In New Trends in Constraints, pages 298–317. LNAI 1865, 2000.

    Google Scholar 

  8. P. V. Hentenryck, V. Saraswat, and Y. Deville. Desing, implementation, and evaluation of the constraint language cc(FD). Journal of Logic Programming, 37(1–3):139–164, 1998.

    Article  Google Scholar 

  9. J. Jaffar and M. J. Maher. Constraint logic programming: A survey. Journal of Logic Programming, 19–20:503–581, 1994.

    Article  MathSciNet  Google Scholar 

  10. L. Martin and C. Vrain. Induction of constraint logic programs. In Proc. of the International Conference on Algorithms and Learning Theory, LNCS 1160, pages 169–176. Springer-Verlag, October 1996.

    MATH  Google Scholar 

  11. F. Mizoguchi and H. Ohwada. Constrained relative least general generalization for inducing constraint logic programs. New Generation Computing, 13:335–368, 1995.

    Article  Google Scholar 

  12. S. Muggleton and L. De Raedt. Inductive Logic Programming: theory and methods. Journal of Logic Programming, 19,20:629–679, 1994.

    Article  MathSciNet  Google Scholar 

  13. S. Padmanabhuni and A. K. Ghose. Inductive constraint logic programming: An overview. In Learning and reasoning with complex representations, LNCS 1359, pages 1–8. Springer-Verlag, 1998.

    Chapter  Google Scholar 

  14. C. Page and A. Frisch. Generalization and learnability: a study of constrained atoms. In Inductive Logic Programming, pages 29–61. London: Academic Press, 1992.

    Google Scholar 

  15. G. Plotkin. A note on inductive generalization. In Machine Intelligence, volume 5, pages 153–163. Edinburgh University Press, 1970.

    MathSciNet  MATH  Google Scholar 

  16. T. L. Provost and M. Wallace. Generalized constraint propagation over the CLP scheme. Journal of Logic Programming, 16(3):319–359, 1993.

    Article  MathSciNet  Google Scholar 

  17. C. Ringeissen and E. Monfroy. Generating propagation rules for finite domains: A mixed approach. In New Trends in Constraints, pages 150–172. LNAI 1865, 2000.

    Google Scholar 

  18. M. Sebag and C. Rouveirol. Constraint inductive logic programming. In Advances in ILP, pages 277–294. IOS Press, 1996.

    Google Scholar 

  19. H. Tamaki and T. Sato. OLD resolution with tabulation. In Proc. of the 3rd International Conference on Logic Programming, LNCS 225, pages 84–98. Springer-Verlag, 1986.

    MATH  Google Scholar 

  20. J. Würtz and T. Müller. Constructive disjunction revisited. In Proc. of the 20th German Annual Conference on Artificial Intelligence, LNAI 1137, pages 377–386. Springer-Verlag, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Munich, Oettingenstr. 67, 80538, München, Germany

    Slim Abdennadher

  2. Laboratoire d’Ingénierie des Systèmes d’Information, Bâtiment 501, INSA Lyon, 69621, Villeurbanne Cedex, France

    Christophe Rigotti

Authors
  1. Slim Abdennadher
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christophe Rigotti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University of York, YO10 5DD, Heslington, York, UK

    Toby Walsh

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abdennadher, S., Rigotti, C. (2001). Towards Inductive Constraint Solving. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-45578-7_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42863-3

  • Online ISBN: 978-3-540-45578-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation