Early projection in CLP(R)

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

Volumn 1520, Issue , 1998, Pages 177-191

  Fordan, Andreas ^a   Yap, Roland H C ^b  

^a FRAUNHOFER FIRST   (Germany)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; HEURISTIC METHODS; LOGIC PROGRAMMING; PROBLEM ORIENTED LANGUAGES;

CONSISTENCY TESTS; CONSTRAINT LOGIC PROGRAMS; EXISTING SYSTEMS; GARBAGE COLLECTION; GENERAL SYSTEMS; LOCAL VARIABLES; PLANNING PROBLEM; QUANTIFIER ELIMINATION;

PROLOG (PROGRAMMING LANGUAGE);

EID: 84957677359     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49481-2_14     Document Type: Conference Paper

References (19)

1. Hartwig Baumgärtel. Distributed constraint processing for production logistics. In Proceedings of the Third International Conference on the Practical Application of Constraint Technology (PACT’97), Blackpool, Lancashire, UK, 1997. The Practical Application Company.
2. A. Fordan, U. Geske, and A. Nareyek. Optimizing constraint-intensive problems using early projection. In Proceedings of the JICSLP Conference, Poster-Session. The MIT Press. Also appeared as GMD-Studie Nr. 296, 1996.
3. Andreas Fordan. Linear projection in CLP(FD). Arbeitspapiere der GMD 1099, Gesellschaft für Mathematik und Datenverarbeitung, Berlin, Germany, 1997.
4. N. Heintze et al. The CLP(R) programmer’s manual, version 1. 2. Technical report, IBM, Yorktown Heights, USA, November 1992.
5. Hewlett-Packard, Bristol. BTS Models/BTS Requirements Specification, May 1992.
6. Christian Holzbaur. Ofai clp(Q,R). Manual, Austrian Research Institute for Artificial Intelligence, Vienna, 1995.
7. Tien Huynh and Jean-Louis Lassez. Practical issues on the projection of polyhedral sets. Technical Report RC 15872 (#70560), IBM Research Division, June 1990.
8. J-L. Imbert. Redundancy, variable elimination and linear disequations. In Inter- national Symposium on Logic Programming (ILPS), pages 139-153, 1994.
9. Jean-Louis Imbert. Fourier’s elimination: Which to choose? In Principles and Practice of Logic Programming. The MIT Press, 1995.
10. J. Jaffar and J-L. Lassez. Constraint logic programming. In Proceedings of the 14th ACM POPL Conference, pages 111-119, January 1987.
11. J. Jaffar, M.J. Maher, P.J. Stuckey, and R.H.C. Yap. Projecting CLP(R) constraints. New Generation Computing, 11(3 & 4):449-469, 1993.
12. Joxan Jaffar, Spiro Michaylov, Peter Stuckey, and Roland Yap. An abstract machine for CLP(R). In Proceedings of the ACM SIGPLAN Symposium on Programming Language Design and Implementation (PLDI), San Francisco, pages 128-139, June 1992.
13. Joxan Jaffar, Spiro Michaylov, and Roland H.C. Yap. A methodology for managing hard constraints in CLP systems. In Proceedings of the ACM-SIGPLAN Conference on Programming Language Design and Implementation. ACM Press, 1991.
14. Joxan Jaffar, Spiro Michayov, Peter Stuckey, and Roland Yap. The CLP(R) language and system. ACM Transactions on Programming Languages and Systems, 14(3):339-395, July 1992.
15. A.D. Kelly, A.D. Macdonald, K. Marriott, H. Søndergaard, P.J. Stuckey, and R.H.C. Yap. An optimizing compiler for CLP(R). In First International Con- ference on Principles and Practice of Constraint Programming, pages 222-239, 1995.
16. A.D. Kelly, A.D. Macdonald, K. Marriott, P.J. Stuckey, and R.H.C. Yap. Effectiveness of optimizing compilation for CLP(R). In JICSLP’96: Joint International Symposium on Logic Programming, pages 37-51, 1996.
17. Andrew D. MacDonald, Peter Stuckey, and Roland Yap. Redundancy of variables in CLP(R). In ILPS’93: Proceedings 3rd International Logic Programming Symposium, Vancouver, 1993.
18. A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, 1986.
19. Peter J. Stuckey. Incremental linear arithmetic constraint solver and detection of implicit equalities. ORSA Journal of Comput., 3(4), 1991.