Telecommunications Feature Subscription as a Partial Order Constraint Problem

被引:2
|
作者
Codish, Michael [1 ]
Lagoon, Vitaly [2 ]
Stuckey, Peter J. [2 ,3 ,4 ]
机构
[1] Ben Gurion Univ Negev, Dept Comp Sci, IL-84105 Beer Sheva, Israel
[2] Univ Melbourne, Dept Comp Sci & Software Engn, Melbourne, Vic 3010, Australia
[3] Natl ICT Australia, Victoria Lab, Sydney, NSW, Australia
[4] UPM, IMDEA Software, Madrid, Spain
来源
关键词
D O I
10.1007/978-3-540-89982-2_70
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper describes the application of a partial order constraint solver to a telecommunications feature subscription configuration problem. Partial order constraints are (encoded to propositional logic. awl solved using a state-of-the-art Boolean satisfaction solver. The encoding is based on a symbol-based approach: symbols are viewed as variables which take integer values and are interpreted as indices in the order. Experimental evaluation indicates that partial order constraints are a viable alternative to previous solutions which apply constraint, programming techniques and integer linear programming.
引用
收藏
页码:749 / +
页数:2
相关论文
共 50 条