{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T12:25:35Z","timestamp":1649075135309},"reference-count":0,"publisher":"AI Access Foundation","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["jair"],"abstract":"<jats:p>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,  which is a generalisation of the feedback vertex  set problem on directed graphs, and thus it is an NP-hard task. We present several constraint programming formulations of the problem. We also present formulations using partial  weighted maximum Boolean satisfiability and mixed integer linear programming.  We study all these formulations by experimentally comparing them  on a variety of randomly generated instances of the feature subscription problem.<\/jats:p>","DOI":"10.1613\/jair.2992","type":"journal-article","created":{"date-parts":[[2018,7,17]],"date-time":"2018-07-17T14:35:57Z","timestamp":1531838157000},"page":"271-305","source":"Crossref","is-referenced-by-count":0,"title":["Developing Approaches  for Solving a Telecommunications Feature Subscription Problem"],"prefix":"10.1613","volume":"38","author":[{"given":"D.","family":"Lesaint","sequence":"first","affiliation":[]},{"given":"D.","family":"Mehta","sequence":"additional","affiliation":[]},{"given":"B.","family":"O'Sullivan","sequence":"additional","affiliation":[]},{"given":"L.","family":"Quesada","sequence":"additional","affiliation":[]},{"given":"N.","family":"Wilson","sequence":"additional","affiliation":[]}],"member":"16860","published-online":{"date-parts":[[2010,6,19]]},"container-title":["Journal of Artificial Intelligence Research"],"original-title":[],"link":[{"URL":"https:\/\/jair.org\/index.php\/jair\/article\/download\/10654\/25468","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/jair.org\/index.php\/jair\/article\/download\/10654\/25469","content-type":"application\/postscript","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/jair.org\/index.php\/jair\/article\/download\/10654\/25468","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,20]],"date-time":"2019-10-20T22:28:03Z","timestamp":1571610483000},"score":1,"resource":{"primary":{"URL":"https:\/\/jair.org\/index.php\/jair\/article\/view\/10654"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,19]]},"references-count":0,"URL":"https:\/\/doi.org\/10.1613\/jair.2992","relation":{},"ISSN":["1076-9757"],"issn-type":[{"value":"1076-9757","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6,19]]}}}