Skip to main content
SpringerLink
Log in

Constraint Solver Synthesis Using Tabled Resolution for Constraint Logic Programming

  • Conference paper
  • First Online:
Logic Based Program Synthesis and Transformation (LOPSTR 2002)

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

  • 176 Accesses

Abstract

The goal of automated program synthesis is to bridge the gap between what is easy for people to describe and what is possible to execute on a computer. In this paper, we present a framework for synthesis of rule-based solvers for constraints given their logical specication. This approach takes advantage of the power of tabled resolution for constraint logic programming, in order to check the validity of the rules. Compared to previous work [8,19,2,5,3], where different methods for automatic generation of constraint solvers have been proposed, our approach enables the generation of more expressive rules (even recursive and splitting rules).

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 39.99
Price excludes VAT (USA)
  • Available as 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abdennadher and T. Fruhwirth. Operational equivalence of CHR programs and constraints. In 5th International Conference on Principles and Practice of Constraint Programming, CP’99, LNCS 1713. Springer-Verlag, 1999.

    Google Scholar 

  2. S. Abdennadher and C. Rigotti. Automatic generation of propagation rules for finite domains. In 6th International Conference on Principles and Practice of Constraint Programming, CP00, LNCS 1894. Springer-Verlag, 2000.

    Google Scholar 

  3. S. Abdennadher and C. Rigotti. Towards inductive constraint solving. In 7th International Conference on Principles and Practice of Constraint Programming, CP’2001, LNCS. Springer-Verlag, 2001.

    Google Scholar 

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

    Google Scholar 

  5. S. Abdennadher and C. Rigotti. Automatic generation of rule-based constraint solvers over finite domains. ACM Transactions on Computational Logic, 2004. to appear.

    Google Scholar 

  6. S. Abdennadher and H. Schutz. CHRV: A flexible query language. Flexible Query Answering Systems, LNAI 1495, 1998.

    Google Scholar 

  7. K. Apt. A proof theoretic view of constraint programming. Special Issue of Fundamenta Informaticae, 34(3), 1998.

    Google Scholar 

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

    Google Scholar 

  9. A. Biermann. Automatic programming. Encyclopedia of Artificial Intelligence, second, extended edition,, 1992.

    Google Scholar 

  10. P. Codognet. A tabulation method for constraint logic programs. In 8th Symposium and Exhibition on Industrial Applications of Prolog, 1995.

    Google Scholar 

  11. B. Cui and D. S. Warren. A system for tabled constraint logic programming. In First International Conference on Computational Logic, LNCS 1861. Springer-Verlag, 2000.

    Google Scholar 

  12. 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, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  13. 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  MATH  Google Scholar 

  14. J. Jaffar and M. J. Maher. Constraint logic programming: A survey. Journal of Logic Programming, 20, 1994.

    Google Scholar 

  15. K. Marriott and P. Stuckey. Programming with Constraints: An Introduction. The MIT Press, 1998.

    Google Scholar 

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

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

    Article  MATH  MathSciNet  Google Scholar 

  18. T. Przymusinski. On constructive negation in logic programming. In Proceedings of the North American Conference on Logic Programming, 1990.

    Google Scholar 

  19. C. Ringeissen and E. Monfroy. Generating propagation rules for finite domains via unification in finite algebra. In New Trends in Constraints. LNAI 1865, 2000.

    Google Scholar 

  20. P. J. Stuckey. Negation and constraint logic programming. Information and Computation, 118(1): 12–33, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  21. H. Tamaki and T. Sato. OLD resolution with tabulation. In 3rd International Conference on Logic Programming, LNCS 225. Springer-Verlag, 1986.

    Google Scholar 

  22. D. S. Warren. Memoing for logic programs. Communications of ACM, 35(4):93–11, 1992.

    Article  MathSciNet  Google Scholar 

  23. J. Würtz and T. Müller. Constructive disjunction revisited. In Proc. of the 20th German Annual Conference on Artificial Intelligence, LNAI 1137. 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, INSA Lyon, Bêatiment 501, 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. Dept. of Electronics and Computer Science, University of Southampton, Highfield, Southampton, SO17 1BJ, UK

    Michael Leuschel

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abdennadher, S., Rigotti, C. (2003). Constraint Solver Synthesis Using Tabled Resolution for Constraint Logic Programming. In: Leuschel, M. (eds) Logic Based Program Synthesis and Transformation. LOPSTR 2002. Lecture Notes in Computer Science, vol 2664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45013-0_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-45013-0_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40438-5

  • Online ISBN: 978-3-540-45013-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation