An open-ended finite domain constraint solver

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

Volumn 1292, Issue , 1997, Pages 191-206

  Carlsson, Mats ^a   Ottosson, Greger ^b   Carlson, Björn ^c  

^a SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

^b UPPSALA UNIVERSITY   (Sweden)

^c PALO ALTO RESEARCH CENTER   (United States)

Author keywords

Constraint programming; Finite domains; Global constraints; Implementation of constraint systems; Indexicals

Indexed keywords

CODES (SYMBOLS); CONSTRAINT THEORY; FUNCTIONAL PROGRAMMING; LOGIC PROGRAMMING; NATURAL LANGUAGE PROCESSING SYSTEMS; WELL TESTING;

CONSTRAINT PROGRAMMING; CONSTRAINT SYSTEMS; FINITE DOMAINS; GLOBAL CONSTRAINTS; INDEXICALS;

PROLOG (PROGRAMMING LANGUAGE);

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

References (29)

1. A. Aggoun and N. Beldiceanu. Extending CHIP in order to solve complex scheduling and placement problems. Mathl. Comput. Modelling, 17(7):57-73, 1993.
2. P. Baptiste and C. Le Pape. A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI-95), Montreal, Canada, August 1995.
3. N. Beldiceanu and E. Contejean. Introducing global constraints in CHIP. Mathl. Comput. Modelling, 20(12):97-123, 1994.
4. B. Carlson and M. Caxlsson. Compiling and Executing Disjunctions of Finite Domain Constraints. In Proceedings of the Twelfth International Conference on Logic Programming. MIT Press, 1995.
5. B. Carlson, M. Carlsson, and D. Diaz. Entailment of finite domain constraints. In Proceedings of the Eleventh International Conference on Logic Programming. MIT Press, 1994.
6. B. Carlson, M. Carlsson, and S. Janson. The implementation of AKL(FD). In Logic Programming: Proceedings of the 1995 International Symposium. MIT Press, 1995.
7. Y. Caseau and F. Laburthe. Improved clp scheduling with task intervals. In P. Van Hentenryck, editor, Logic Programming, Proceedings of the Eleventh International Conference on Logic Programming, pages 369-383, Santa Margherita Ligure, Italy, 1994. MIT Press.
8. Philippe Codognet and Giuseppe Nardiello. Enhancing the constraint-solving power of clp(FD) by means of path-consistency methods. In A. Podelski, editor, Constraints: Basics and Trends, volume 910 of Lecture Notes in Computer Science, pages 37-61. Springer-Verlag, 1995.
9. D. Diaz and P. Codognet. A Minimal Extension of the WAM for CLP(FD). In Proceedings of the International Conference on Logic Programming, pages 774-790, Budapest, Hungary, 1993. MIT Press.
10. M. Dincbas, P. van Hentenryck, H. Simonis, A. Aggoun, T. Graf, and F. Berthier. The Constraint Logic Programming Language CHIP. In Proceedings of the International Conference on Fifth Generation Computer Systems, 1988.
11. Mats Carlsson et al. SICStus Prolog User’s Manual. SICS Research Report, Swedish Institute of Computer Science, 1995. URL: http://www.sics.se/isl/sicstus.html.
12. Micha Meier et al. ECLiPSe user manual. ECRC Research Report ECRC-93-6, European Computer Research Consortium, 1993.
13. C. Holzbaur. Specification of Constraint Based Inference Mechanism through Extended Unification. PhD thesis, Dept, of Medical Cybernetics and Al, University of Vienna, 1990.
14. ILOG. ILOG Solver C++. Reference manual, ILOG S.A., 1993.
15. R. Mohr and T.C. Henderson. Arc and path consistency revisited. Artificial Intelligence, 28:225-233, 1986.
16. W. Older and A. Vellino. Constraint arithmetic on real intervals. In Constraint Logic Programming: Selected Research (eds. Benhamou and Colmerauer). MIT Press, 1993.
17. Prolog IA. Le manuel de Prolog IV. Reference manual, ProloglA S.A., 1997.
18. J.-F. Puget and M. Leconte. Beyond the glass box: Constraints as objects. In J. Lloyd, editor, Proceedings of the International Logic Programming Symposium (ILPS-95), pages 513-527, Portland, 1995.
19. J.-C. Régin. A filtering algorithm for constraints of difference in CSPs. In Proc. of the Twelfth National Conference on Artificial Intelligence (AAAI-94), pages 362-367, 1994.
20. Vijay A. Saraswat. Concurrent Constraint Programming Languages. PhD thesis, Carnegie-Mellon University, January 1990.
21. Gregory Sidebottom. A Language for Optimizing Constraint Propagation. PhD thesis, Simon Fraser University, November 1993.
22. Gert Smolka. The Oz programming model. In J. van Leeuwen, editor, Computer Science Today, volume 1000 of Lecture Notes in Computer Science, pages 324-343. Springer-Verlag, 1995.
23. Pascal Van Hentenryck and Yves Deville. The cardinality operator: a new logical connective in constraint logic programming. In International Conference on Logic Programming. MIT Press, 1991.
24. Pascal Van Hentenryck, Vijay Saraswat, and Yves Deville. Constraint processing in cc(FD). Draft, Computer Science Department, Brown University, 1991.
25. Pascal Van Hentenryck, Vijay Saraswat, and Yves Deville. Design, implementation and evaluation of the constraint language cc(FD). In A. Podelski, editor, Constraints: Basics and Trends, volume 910 of Lecture Notes in Computer Science. Springer-Verlag, 1995.
26. D. Waltz. The Psychology of Computer Vision (Ed. P. Winston), chapter Understanding line drawings of scenes with shadows. McGraw-Hill, New York, 1975.
27. H.P. Williams. Model Building in Mathematical Programming. J. Wiley and sons, New York, 1978.
28. Jörg Würtz, 1997. Personal Communication.
29. Neng-Fa Zhou. B-Prolog User’s Manual Version 2.1. Technical report, Kyushu Institute of Technology, 1997. URL: http://www.cad.mse.kyutech.ac.jp/people/zhou/bprolog.html.