Solving a telecommunications feature subscription configuration problem

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

Volumn 5202 LNCS, Issue , 2008, Pages 67-81

  Lesaint, David ^a   Mehta, Deepak ^b   O'Sullivan, Barry ^b   Quesada, Luis ^b   Wilson, Nic ^b  

^a BRITISH TELECOM   (United Kingdom)

^b UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; EMBEDDED SYSTEMS; INTEGER PROGRAMMING; LINEARIZATION; NUCLEAR PROPULSION;

CALL CONTROLS; CONSTRAINT PROGRAMMINGS; FEATURE INTERACTIONS; INTEGER LINEAR PROGRAMMINGS; NP-HARD; WEIGHTED CONSTRAINTS; WEIGHTED MAXIMUM SATISFIABILITY;

LINEAR PROGRAMMING;

EID: 56449131494     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85958-1_5     Document Type: Conference Paper

References (19)

1. Bond, G.W., Cheung, E., Purdy, H., Zave, P., Ramming, C.: An Open Architecture for Next-Generation Telecommunication Services. ACM Transactions on Internet Technology 4(1), 83-123 (2004)
2. Jackson, M., Zave, P.: Distributed Feature Composition: a Virtual Architecture for Telecommunications Services. IEEE TSE 24(10), 831-847 (1998)
3. Jackson, M., Zave, P.: The DFC Manual. AT&T (November 2003)
4. Bessiere, C.: Constraint propagation. Technical Report 06020, LIRMM, Montpellier,France (March 2006)
5. Zave, P., Goguen, H., Smith, T.M.: Component Coordination: a Telecommunication Case Study. Computer Networks 45(5), 645-664 (2004)
6. Zave, P.: An Experiment in Feature Engineering. In: Mclver, A., Morgan, C. (eds.) Programming Methodology, pp. 353-377. Springer, Heidelberg (2003)
7. Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. The MIT Press, Cambridge (1990)
8. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the The Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
9. Wallace, M.: Practical applications of constraint programming. Constraints Journal 1(1), 139-168 (1996)
10. Dooms, G., Deville, Y., Dupont, P.: CP(Graph): Introducing a graph computation domain in constraint programming. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 211-225. Springer, Heidelberg (2005)
11. Bessiere, C., Stergiou, K., Walsh, T.: Domain filtering consistencies for non-binary constraints. Artificial Intelligence (2007)
12. Debruyne, R., Bessiére, C.: Some practical filtering techniques for the constraint satifaction problem. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence, Nagoya, Japan, pp. 412-417 (1997)
13. Presser, P., Stergiou, K., Walsh, T.: Singleton Consistencies. In: CP 2000, pp. 353-368 (September 2000)
14. Lecoutre, C., Patrick, P.: Maintaining singleton arc consistency. In: Proceedings of the 3rd International Workshop on Constraint Propagation And Implementation (CPAI 2006) held with CP 2006, Nantes, France, pp. 47-61 (September 2006)
15. Hawkins, P., Lagoon, V., Stuckey, P.J.: Solving set constraint satisfaction problems using ROBDDs. Journal of Artificial Intelligence Research 24, 109-156 (2005)
16. Laburthe, F., Jussien, N.: JChoco: A java library for constraint programming
17. Le Berre, D.: SAT4J: An efficient library of SAT solvers in Java
18. ILOG: CPLEX solver 10.1, http://www.ilog.com/products/cplex/
19. Bond, G.W., Cheung, E., Goguen. H., Hanson, K.J., Henderson. D., Karam, G.M., Purdy, K.H., Smith, T.M., Zave, P.: Experience with Component-Based Development of a Telecommunication Service. In: Heineman, G.T., Cmković, I., Schmidt, H.W., Stafford, J.A., Szyper-ski, C.A., Wallnau. K. (eds.) CBSE 2005. LNCS, vol. 3489, pp. 298-305. Springer, Heidelberg (2005)