Indexical-based solver learning

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

Volumn 2470, Issue , 2002, Pages 541-556

  Dao, Thi Bich Hanh ^a   Lallouet, Arnaud ^a   Legtchenko, Andrei ^a   Martin, Lionel ^a  

^a UNIVERSITÉ D'ORLÉANS   (France)

Author keywords

Consistency; CSP; Learning; Rule based constraint solver

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT SATISFACTION PROBLEMS; CONSTRAINT THEORY; ITERATIVE METHODS; OPEN SOURCE SOFTWARE; SEMANTICS;

CHAOTIC ITERATION; CONSISTENCY; CONSTRAINT SOLVERS; LANGUAGE INDEPENDENTS; LEARNING; MACHINE LEARNING TECHNIQUES; OPERATIONAL SEMANTICS; REWRITING SEMANTICS;

LEARNING SYSTEMS;

EID: 29344431839     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46135-3_36     Document Type: Conference Paper

References (23)

1. S. Abdennadher and C. Rigotti. Automatic generation of propagation rules for finite domains. In Rina Dechter, editor, Constraint Programming, volume 1894 of LNCS, pages 18–34, Singapore, 2000. Springer.
2. S. Abdennadher and C. Rigotti. Towards inductive constraint solving. In Toby Walsh, editor, Constraint Programming, volume 2239 of LNCS, pages 31–45. Springer, Nov 26 - Dec 1 2001.
3. K. R. Apt. The essence of constraint propagation. Theoretical Computer Science, 221(1-2):179–210, 1999.
4. K. R. Apt and E. Monfroy. Automatic generation of constraint propagation algorithms for small finite domains. In Constraint Programming CP’99, 1999.
5. K. R. Apt and E. Monfroy. Constraint programming viewed as rule-based programming. Theory and Practice of Logic Programming, 1(6):713 – 750, 2001.
6. Michel Bergére, Thi Bich Hanh Dao, AbdelAli Ed-Dbali, Gérard Ferrand, Arnaud Lallouet, Andrei Legtchenko, Lionel Martin, and Christel Vrain. Learning interval bounds of indexical-based solvers. Research Report RR-LIFO-2002-07, LIFO, Université d’Orléans, BP 6759, F-45067 Orléans Cedex 2, 2002.
7. Stephano Bistarelli, Ugo Montanari, and Francesca Rossi. Semiring-based constraint satisfaction and optimization. Journal of the ACM, 44(2):201–236, March 1997.
8. Mats Carlsson, Greger Ottosson, and Björ Carlson. An open-ended finite domain constraint solver. In HughGlaser, Pieter H. Hartel, and Herbert Kuchen, editors, Programming Languages: Implementations, Logics, and Programs, volume 1292 of LNCS, pages 191–206, Southampton, UK, September 3-5 1997. Springer.
9. Philippe Codognet and Daniel Diaz. A minimal extension of the wam for clp(fd). In David Scott Warren, editor, International Conference on Logic Programming, pages 774–790, Budapest, Hungary, June 21-25 1993. MIT Press.
10. Philippe Codognet and Daniel Diaz. Compiling constraints in clp(fd). Journal of Logic Programming, 27(3):185–226, 1996.
11. Daniel Diaz and Philippe Codognet. Design and implementation of the gnu prolog system. Journal of Functional and Logic Programming, 2001(6), 2001.
12. Mehmet Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, and A. Herold. The CHIP System: Constraint Handling in Prolog. In Ewing Lusk and Ross Overbeek, editors, 9th International Conference on Automated Deduction, Argonne, May 1988. Springer.
13. Fran¸cois Fages, Julian Fowler, and Thierry Sola. Experiments in reactive constraint logic programming. Journal of Logic Programming, 37(1-3):185–212, 1998
14. Thom Früwirth. Theory and practice of Constraint Handling Rules. Journal of Logic Programming, 37(1-3):95–138, 1998.
15. Joxan Jaffar, Spiro Michaylov, Peter J. Stuckey, and Roland H. C. Yap. The CLP(R) language and system. ACM Transactions on Programming Languages and Systems, 14(3):339–395, 1992.
16. Fran¸cois Laburthe and the OCRE project. Choco: implementing a CP kernel. In TRICS, Techniques foR Implementing Constraint programming Systems, CP 2000 post-conference workshop, Technical report TRA9/00, Singapore, sep 2000.
17. Thierry Le Provost and Mark Wallace. Generalized constraint propagation over the CLP Scheme. Journal of Logic Programming, 16:319–359, 1993.
18. Jean-Francois Puget and Michel Leconte. Beyond the glass box: Constraints as objects. In John W. Lloyd, editor, International Logic Programming Symposium, pages 513–527, Portland, Oregon, 1995. MIT Press
19. Jean-Charles Régin. A filtering algorithm for constraints of difference in csps. In AAAI, National Conference on Artificial Intelligence, pages 362–367, Seattle, WA, USA, 1994. AAAI Press.
20. Edward Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.
21. P. van Hentenryck, V. Saraswat, and Y. Deville. Constraint processing in cc(fd). draft, 1991.
22. V. N. Vapnik. The Nature of Statistical Learning Theory. Springer, New York, 1995.
23. Neng-Fa Zhou. A high-level intermediate language and the algorithms for compiling finite-domain constraints. In Joxan Jaffar, editor, Joint International Conference and Symposium on Logic Programming, pages 70–84, Manchester, UK, 15-19 June 1998. MIT Press.