Answer set optimization for and/or composition of CP-nets: a security scenario

  • Authors:
  • Stefano Bistarelli;Pamela Peretti;Irina Trubitsyna

  • Affiliations:
  • Dipartimento di Scienze, Università "G. d'Annunzio", Pescara, Italy and Istituto di Informatica e Telematica, CNR, Pisa, Italy;Dipartimento di Scienze, Università "G. d'Annunzio", Pescara, Italy;DEIS, Università della Calabria, Rende, Italy

  • Venue:
  • CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Defence trees are used to represent attack and defence strategies in security scenarios; the aim in such scenarios is to select the best set of countermeasures have to be applied to stop all the vulnerabilities. To represent the preference among the possible countermeasures of a given attack, defence trees are enriched with CP-networks (CP-net for short). However, for complex trees, composing CP-nets could be not always effective. In this paper we overcome these limitations by transforming each CP-net in an Answer Set Optimization (ASO) program. The ASO program, representing the overall scenario, is a special composition of the programs associated to each branch of the defence tree. The best set of countermeasure able to mitigate all the vulnerabilities is then obtained by computing the optimal answer set of the corresponding ASO program.