Solving hierarchies of finite-domain constraints

Journal of Experimental and Theoretical Artificial Intelligence

Volumn 10, Issue 1, 1998, Pages 130-142

  Wolf, Armin ^a  

^a FRAUNHOFER FIRST   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85024197757     PISSN: 0952813X     EISSN: 13623079     Source Type: Journal    
DOI: 10.1080/095281398146969     Document Type: Article

References (27)

1. Aggoun, A. and Beldiceanu, N. (1993) Extending CHIP in order to solve complex scheduling and placement problems. Journal of Mathematical and Computer Modelling, 17(7): 57-73.
2. Bistarelli, S., Fargier, H., Montanari, U., Rossi, F., Schiex, T. and Verfaillie, G. (1996) Semiring-based CSPs and valued CSPs: Basic properties and comparison. In M. Jampel, E. Freuder, and M. Maher (eds.) Over-constrained systems, Lecture Notes in Computer Science, vol. 1106 (Berlin: Springer), pp. 111-150.
3. Borning, A. and Duisberg, R. (1986) Constraint-based tools for building user interfaces. ACM Transactions on Graphics, 5(4): 345-374.
4. Borning, A., Duisberg, R., Freeman-Benson, B., Kramer, A. and Woolf, M. (1987) Constraint hierarchies. In Proceedings of the 1987 ACM Conference on Object-Oriented Programming Systems, Languages, and Applications-OOPSLA'87, October 1987 (New York: ACM Press), pp. 48-60.
5. Caseau, Y. and Laburthe, F. (1994) Improved CLP scheduling with task intervals. In P. van Hentenryck (ed.) Proceedings of the Eleventh International Conference on Logic Programming, ICLP'94, (Cambridge, MA: MIT Press), pp. 369-383.
6. COSYTEC (1996) CHIP V5 User Manual (Orsay Cedex, France: COSYTEC Complex Systems Technologies).
7. ECRC (1995a) ECL1PSC3.5 Extensions User Manual (Munich: ECRC).
8. ECRC (1995b) ECL'PSe3.5 User Manual (Munich: ECRC).
9. Freeman-Benson, B., Wilson, M. and Borning, A. (1992) DeltaStar: A general algorithm for incremental satisfaction of constraint hierarchies. In Proceedings of the 11th Annual IEEE Phoenix Conference on Computers and Communication, April 1992, Scottsdale, AZ, pp. 561-568.
10. Goltz, H.-J. (1995) Reducing domains for search in CLP(FD) and its application to job-shop scheduling. In U. Montanari and F. Rossi (eds.) Proceedings of the First International Conference on Principles and Practice of Constraint Programming-CP'95, 19-22 September 1995, Cassis, France, Lecture Notes in Computer Science, Vol. 976. (Berlin: Springer). pp. 549-562.
11. Holzbaur, C., Menezes, F. and Barohona, P. (1996) Defeasibility in CLP (^) through generalized slack variables. In E. C. Freuder (ed.) Proceedings of the Second International Conference on Principles and Practice of Constraint Programming-CP' 96, August 1996, Cambrid ge, MA, USA, Lecture Notes in Computer Science, vol. 1118. (Berlin: Springer), pp. 209-223.
12. Hower, W. and Ruttkay, Z. (eds.) (1996) Non-Standard Constraint Processing, working notes of the ECAI-96 workshop W27, Budapest, Hungary, August 1 996.
13. Jampel, M. (1996a) A brief overview of over-constrained systems. In Over-constrained Systems, Lecture Notes in Computer Science, Vol. 1106, (Berlin: Springer), pp. 1-22.
14. Jampel, M. (1996b) A compositional theory ofconstraint hierarchies. In Over-constrained Systems, Lecture Notes in Computer Science, Vol. 1106, (Berlin: Springer), pp. 189-206.
15. Jampel, M., Freuder, E. and Maher, M. (eds.) (1996a) Over-constrained Systems, Lecture Notes in Computer Science, Vol. 1106, (Berlin: Springer).
16. Jampel, M., Jacquet, J.-M., Gilbert, D. and Hunt, S. (1996b) Transformations between HCLP and PCSP. In Eugene C. Freuder (ed.) Proceedings of the Second International Conference on Principles and Practice of Constraint Programming-CP' 96, August 1996, Cambrid ge, MA, USA, Lecture Notes in Computer Science, Vol. 1118, (Berlin: Springer), pp. 252-267.
17. Menezes, F. and Barohona, P. (1995) An Incremental Hierarchical Constraint Solver, in V. Saraswat and P. Van Hentenryck (eds.) Principles and Practice of Constraint Programming (Cambridge, MA: MIT Press), pp. 291-316.
18. Mittal, S. and Falkenhainer, B. (1990) Dynamic constraint satisfaction problems. In Proceedings of the AAAT90, Boston, MA (Menlo Park, CA: AAAI Press), pp. 25-32.
19. Newberry-Paulisch, F. and Tichy, W. F. (1990) Edge: an extendible graph editor. Software-Practice and Experience, 20(51): 63-88.
20. Sannella, M. (1994) The SkyBlue constraint solver and its applications. In V. A. Saraswat and P. van Hentenryck (eds.) Proceedings of the 1993 Workshop on Principles and Practice of Constraint Programming (Cambridge, MA: MIT Press), pp. 385-406.
21. Satoh, K. and Aiba, A. (1991) Computing soft constraints by hierarchical constraint logic programming. Technical Report 610, Institute for New Generation Computer Technology (ICOT) Japan.
22. Stumptner, M., Haselbock, A. and Friedrich, G. (1994) COCOS-a tool for constraint-based, dynamic configuration. In 10th IEEE Conference on AI Applications (CAIA).
23. Tsusumi, F. (1994) An efficient algorithm of logic programming with constraint hierarchy. In J.-P. Jouannaud, (ed.) Proceedings of the First International Conference on Constraints in Computational Logics, Lecture Notes in Computer Science, Vol. 845, (Berlin: Springer), pp. 170-182.
24. van Hentenryck, P. and le Provost, T. (1991) Incremental search in constraint logic programming. New Generation Computing 5(3, 4): 257-275.
25. Wilson, M. A. (1993) Hierarchical Constraint Logic Programming. PhD thesis, Department of Computer Science and Engineering, University of Washington, USA.
26. Wilson, M. A. and Borning, A. (1993) Hierarchical constraint logic programming. The Journal of Logic Programming, 16(3, 4): 277-318.
27. Wolf, A. (1996) Transforming ordered constraint hierarchies into ordinary constraint systems. In M. Jampel, E. Freuder, and M. Maher (eds.) Over-constrained Systems, Lecture Notes in Computer Science, Vol. 1106, (Berlin: Springer) pp. 171-188.