Skip to main content
Springer Nature Link
Log in

SoleX: A domain-independent scheme for constraint solver extension

  • Conference paper
  • First Online:
Artificial Intelligence and Symbolic Computation (AISC 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1476))

Abstract

In declarative programming languages based on the constraint programming paradigm, computations can be viewed as deductions and are enhanced with the use of constraint solvers. However, admissible constraints are restricted to formulae handled by solvers and thus, declarativity may be jeopardized. We present a domain-independent scheme for extending constraint solvers with new function symbols. This mechanism, called SoleX, consists of a collaboration of elementary solvers. They add and deduce information related to constraints involving new functions, complete the computation domain and purify constraints. Some extensions of computation domains have already been studied to demonstrate the broad scope of SoleX potential applications.

CLP(R + M) is obtained by extending the domain of CLP(R) with some special nonarithmetic function symbols.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Baader and K. Schulz. On the combination of symbolic constraints, solution domains, and constraint solvers. In Proc. of CP’95, volume 976 of LNCS, 1995.

    Google Scholar 

  2. F. Benhamou and L. Granvilliers. Combining local consistency, symbolic rewriting, and interval methods. In J. Pfalzgraf, editor, Proc. AISMC-3, volume 1138 of LNCS, Steyr, Austria, Sep. 1996. Springer-Verlag.

    Google Scholar 

  3. B. Buchberger. Applications of Gröbner Bases in Non-Linear Computational Geometry. In D. Kapur and J. Mundy, editors, Geometric Reasoning, pages 413–446. MIT Press, 1989.

    Google Scholar 

  4. O. Caprotti. Extending risc-clp(cf) to handle symbolic functions. In A. Miola, editor, Proc. of DISCO ’93, volume 722 of LNCS. Springer-Verlag, Sep. 1993.

    Google Scholar 

  5. T. Frühwirth. Constraint handling rules. In A. Podelski, editor, Constraint Programming: Basics and Trends, volume 910 of LNCS. Springer-Verlag, 1995.

    Google Scholar 

  6. N. Heintze, S. Michaylov, P. J. Stuckey, and R. H. C. Yap. Meta-Programming in CLP(R). JLP, pages 221–259, 1997.

    Google Scholar 

  7. K. Homann and J. Calmet. Combining Theorem Proving and Symbolic Mathematical Computing. In J.A. Campbell J. Calmet, editor, Proc. of AISMC-2, volume 814 of LNCS, pages 18–29. Springer-Verlag, 1995.

    Google Scholar 

  8. J. Jaffar and M. Maher. Constraint Logic Programming: a Survey. JLP, 19, 20:503–581, 1994.

    MathSciNet  Google Scholar 

  9. J. Jaffar, S. Michaylov, P. Stuckey, and R. Yap. The CLP(R) Language and System. ACM Transactions on Programming Languages and Systems, 14(3):339–395, 1992.

    Article  Google Scholar 

  10. C. Kirchner, H. Kirchner, and M. Vittek. Designing constraint logic programming languages using computational systems. In P. Van Hentenryck and V. Saraswat, editors, Principles and Practice of Constraint Programming. The Newport Papers., pages 131–158. MIT press, 1995.

    Google Scholar 

  11. H. Kirchner and C. Ringeissen. Combining symbolic constraint solvers on algebraic domains. JSC, 18(2):113–155, 1994.

    MATH  MathSciNet  Google Scholar 

  12. E. Monfroy. Collaboration de solveurs pour la programmation logique à contraintes. Phd thesis, Université Henri Poincaré-Nancy 1, Nov. 1996. Also available in english.

    Google Scholar 

  13. E. Monfroy and C. Ringeissen. SoleX: a Domain-Independent Scheme for Constraint Solver Extension (Extended Version). Research report, INRIA, Jun. 1998. Also available at url http://www.inria.fr.

    Google Scholar 

  14. E. Monfroy, M. Rusinowitch, and R. Schott. Implementing Non-Linear Constraints with Cooperative Solvers. In Proc. of ACM SAC’96, pages 63–72, Feb. 1996.

    Google Scholar 

  15. C. G. Nelson and D. C. Oppen. Simplifications by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2), 1979.

    Google Scholar 

  16. The Calculemus Project. Calculemus Workshop: Systems for Integrated Computation and Deduction, Edinburgh, Scotland, Sep. 1997.

    Google Scholar 

  17. S. Wolfram. The Mathematica Book, 3rd ed. Cambridge University Press, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CWI, P.O. Box 94079, NL-1090, GB Amsterdam, The Netherlands

    Eric Monfroy

  2. LORIA-INRIA, 615 rue du Jardin Botanique, BP 101, F-54602, Villers-lès-Nancy Cedex, France

    Christophe Ringeissen

Authors
  1. Eric Monfroy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christophe Ringeissen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jacques Calmet Jan Plaza

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Monfroy, E., Ringeissen, C. (1998). SoleX: A domain-independent scheme for constraint solver extension. In: Calmet, J., Plaza, J. (eds) Artificial Intelligence and Symbolic Computation. AISC 1998. Lecture Notes in Computer Science, vol 1476. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055915

Download citation

  • DOI: https://doi.org/10.1007/BFb0055915

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64960-1

  • Online ISBN: 978-3-540-49816-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics