A declarative encoding of telecommunications feature subscription in SAT

Authors:
Michael Codish;Samir Genaim;Peter J. Stuckey
Affiliations:
Ben-Gurion University of the Negev, Beer-Sheva, Israel;Universidad Complutense de Madrid, Madrid, Spain;University of Melbourne, Australia, Melbourne, Australia
Venue:
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Year:
2009

Citing 8
Cited 4

Introduction to algorithms

Introduction to algorithms
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Efficient conflict driven learning in a boolean satisfiability solver

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
An open architecture for next-generation telecommunication services

ACM Transactions on Internet Technology (TOIT)
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
On teaching fast adder designs: revisiting ladner & fischer

Theoretical Computer Science

Developing approaches for solving a telecommunications feature subscription problem

Journal of Artificial Intelligence Research
SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs

Journal of Automated Reasoning
Efficient unfolding of contextual Petri nets

Theoretical Computer Science
Verification of petri nets with read arcs

CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

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.