Telecommunications Feature Subscription as a Partial Order Constraint Problem

Authors:
Michael Codish;Vitaly Lagoon;Peter J. Stuckey
Affiliations:
Department of Computer Science, Ben-Gurion University, Israel;Department of Computer Science and Software Engineering, The University of Melbourne, Australia;Department of Computer Science and Software Engineering, The University of Melbourne, Australia and Victoria Laboratory, National ICT Australia, and IMDEA Software, UPM, Spain
Venue:
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Year:
2008

Citing 3
Cited 0

Logic programming with satisfiability

Theory and Practice of Logic Programming
Solving a Telecommunications Feature Subscription Configuration Problem

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Solving partial order constraints for LPO termination

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 and 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.