Solex: AdDomain-Independent scheme for constraint solver extension

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1476, Issue , 1998, Pages 222-233

  Monfroy, Eric ^a   Ringeissen, Christophe ^b  

^a CWI   (Netherlands)

^b LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY;

COMPUTATION DOMAINS; CONSTRAINT PROGRAMMING; CONSTRAINT SOLVERS; DECLARATIVE PROGRAMMING LANGUAGE; DOMAIN INDEPENDENTS; NEW FUNCTIONS;

LOGIC PROGRAMMING;

EID: 84961381910     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055915     Document Type: Conference Paper

References (17)

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.
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.
3. B. Buchberger. Applications of GrObner Bases in Non-Linear Computational Geometry. In D. Kapur and J. Mundy, editors, Geometric Reasoning, pages 413-446. s, 1989.
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.
5. T. Frithwirth. Constraint handling rules. In A. Podelski, editor, Constraint Programming: Basics and Trends, volume 910 of LNCS. Springer-Verlag, 1995.
6. N. Heintze, S. Michaylov, P. J. Stuckey, and R. H. C. Yap. Meta-Programming in CLP(R). JLP, pages 221-259, 1997.
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.
8. J. Jaffar and M. Maher. Constraint Logic Programming: a Survey. JLP, 19,20:503-581, 1994.
9. J. Jaffar, S. Michaylov, P. Stuckey, and R. Yap. The CLP(1Z) Language and System. ACM Transactions on Programming Languages and Systems, 14(3):339-395, 1992.
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.
11. H. Kirchner and C. Ringeissen. Combining symbolic constraint solvers on algebraic domains. JSC, 18(2):113-155, 1994.
12. E. Monfroy. Collaboration de solveurs pour la programmation logique a contraintes. Phd thesis, Universite Henri Poincare - Nancy 1, Nov. 1996. Also available in english.
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.
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.
15. C. G. Nelson and D. C. Oppen. Simplifications by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2), 1979.
16. The Calculemus Project. Calculemus Workshop: Systems for Integrated Computation and Deduction, Edinburgh, Scotland, Sep. 1997.
17. S. Wolfram. The Mathematica Book, 3rd ed. Cambridge University Press, 1996.