Telecommunications feature subscription as a partial order constraint problem

Michael Codish, Vitaly Lagoon, Peter J. Stuckey

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations


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.

Original languageEnglish
Title of host publicationLogic Programming - 24th International Conference, ICLP 2008, Proceedings
Number of pages5
StatePublished - 1 Dec 2008
Event24th International Conference on Logic Programming, ICLP 2008 - Udine, Italy
Duration: 9 Dec 200813 Dec 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5366 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference24th International Conference on Logic Programming, ICLP 2008

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Telecommunications feature subscription as a partial order constraint problem'. Together they form a unique fingerprint.

Cite this