Solving a Telecommunications Feature Subscription Configuration Problem

Abstract. Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature subscription involves choosing and sequencing features from a catalogue and is subject to constraints that prevent undesirable feature interactions at run-time. When the subscription requested by a user is inconsistent, one problem is to find an optimal relaxation. In this paper, we show that this problem is NP-hard and we present a constraint programming formulation using the variable weighted constraint satisfaction problem framework. We also present simple formulations using partial weighted maximum satisfiability and integer linear programming. We experimentally compare our formulations of the different approaches; the results suggest that our constraint programming approach is the best of the three overall.

• Type: Conference
• Year: 2008
• Where: CP
• Authors: David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson
• Keywords: Artificial Intelligence, Constraint Programming, Constraint Programming Formulation, CP 2008, Variable Weighted Constraint