A declarative encoding of telecommunications feature subscription in SAT

Michael Codish, Samir Genaim, Peter J. Stuckey

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

6 Scopus citations

Abstract

This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean satisfaction solver. The transformation of a problem instance to a corresponding propositional formula in conjunctive normal form is obtained in a declarative style. An experimental evaluation indicates that our encoding is considerably faster than previous approaches based on the use of Boolean satisfaction solvers. The key to obtaining such a fast solver is the careful design of the Boolean representation and of the basic operations in the encoding. The choice of a declarative programming style makes the use of complex circuit designs relatively easy to incorporate into the encoder and to fine tune the application.

Original languageEnglish
Title of host publicationPPDP'09 - Proceedings of the 11th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming
Pages255-265
Number of pages11
DOIs
StatePublished - 30 Nov 2009
Event11th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, PPDP'09 - Coimbra, Portugal
Duration: 7 Sep 20099 Sep 2009

Publication series

NamePPDP'09 - Proceedings of the 11th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming

Conference

Conference11th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, PPDP'09
Country/TerritoryPortugal
CityCoimbra
Period7/09/099/09/09

Keywords

  • Declarative modelling
  • SAT solving
  • Telecommunications feature subscription

Fingerprint

Dive into the research topics of 'A declarative encoding of telecommunications feature subscription in SAT'. Together they form a unique fingerprint.

Cite this