Feature Interaction as a Satisfiability Problem

C. Areces, W. Bouma, and M. de Rijke. Feature Interaction as a Satisfiability Problem. In Proceedings of MASCOTS'99, pp. 339–346, IEEE Computer Society, Los Alamitos, California, 1999.

Download

[pdf] 

Abstract

We present a formal model for the specification of tele- phone features by means of description logics. Our frame- work permits the formal definition of the basic telephone system as well as the specification of additional features (Call Waiting, Call Forwarding, etc.). Furthermore, by using standard reasoning tasks from Description Logics, properties of features can be formally proved and interac- tions detected. An EXPTIME upper bound for the complex- ity of detecting feature interaction as a satisfiability problem is provided by exploiting well-known results for expressive description languages.

BibTeX

@InProceedings{Areces1999e,
  author =       "C. Areces and W. Bouma and M. de Rijke",
  booktitle =    "Proceedings of \emph{MASCOTS'99}",
  title =        "Feature Interaction as a Satisfiability Problem",
  year =         "1999",
  abstract =     "We present a formal model for the specification of
                 tele- phone features by means of description logics.
                 Our frame- work permits the formal definition of the
                 basic telephone system as well as the specification of
                 additional features (Call Waiting, Call Forwarding,
                 etc.). Furthermore, by using standard reasoning tasks
                 from Description Logics, properties of features can be
                 formally proved and interac- tions detected. An EXPTIME
                 upper bound for the complex- ity of detecting feature
                 interaction as a satisfiability problem is provided by
                 exploiting well-known results for expressive
                 description languages.",
  address =      "Los Alamitos, California",
  pages =        "339--346",
  publisher =    "IEEE Computer Society",
}