http://www.cnr.it/ontology/cnr/individuo/prodotto/ID29974

Answer Set Optimization for and/or Composition of CP-Nets: A Security Scenario (Articolo in rivista)

Type

Label

Answer Set Optimization for and/or Composition of CP-Nets: A Security Scenario (Articolo in rivista) (literal)

Anno

Alternative label

[1] Bistarelli S., [2] Peretti P., [3] Trubitsyna I. (2007)
Answer Set Optimization for and/or Composition of CP-Nets: A Security Scenario
in Lecture notes in computer science; Springer-Verlag, Berlin (Germania)
(literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori

Pagina inizio

Pagina fine

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume

Rivista

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni

[1] CNR-IIT, Pisa, Italy; [2] Dipartimento di Scienze, Università G. dAnnunzio, Chieti-Pescara, Italy; [3] DEIS Università della Calabria, Rende, Italy (literal)

Titolo

Answer Set Optimization for and/or Composition of CP-Nets: A Security Scenario (literal)

Abstract

Defence trees are used to represent attack and defence strate- gies 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 ef- fective. In this paper we overcome these limitations by transforming each CP-net in an Answer Set Optimization (ASO) program. The ASO pro- gram, 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. (literal)

Editore