#### Filter Results:

- Full text PDF available (15)

#### Publication Year

2004

2017

- This year (1)
- Last 5 years (9)
- Last 10 years (21)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Marc Pouly
- 2004

Valuation algebras are known to present a common roof over various applications out of different domains of research. In combination with the power of local computation it offers a possibility to solve inference problems in an efficient way. Implementing concretely these concepts by instantiating a valuation algebra means loosing the high level of… (More)

- Marc Pouly
- Canadian Conference on AI
- 2011

- Barbara Kordy, Marc Pouly, Patrick Schweitzer
- SIIS
- 2011

Attack–defense trees extend attack trees with defense nodes. This richer formalism allows for a more precise modeling of a system’s vulnerabilities, by representing interactions between possible attacks and corresponding defensive measures. In this paper we compare the computational complexity of both formalisms. We identify semantics for which extending… (More)

- Marc Pouly
- ECSQARU
- 2011

- Barbara Kordy, Marc Pouly, Patrick Schweitzer
- IFM
- 2014

This work addresses the growing need of performing meaningful probabilistic analysis of security. We propose a framework that integrates the graphical security modeling technique of attack–defense trees with probabilistic information expressed in terms of Bayesian networks. This allows us to perform probabilistic evaluation of attack– defense scenarios… (More)

- Marc Pouly
- International Journal on Artificial Intelligence…
- 2010

Computing inference from a given knowledgebase is one of the key competences of computer science. Therefore, numerous formalisms and specialized inference routines have been introduced and implemented for this task. Typical examples are Bayesian networks, constraint systems or different kinds of logic. It is known today that these formalisms can be unified… (More)

- Marc Pouly
- 2008

The distributive law known from arithmetics is one of the best tools for a computer scientist to grapple with the intractable nature of many applications. So, efficient algorithms have been developed for the computation of Fourier and Hadamard transforms, Bayesian networks, database queries, decoding problems and many more. The fact that they all benefit… (More)

- Jürg Kohlas, Marc Pouly, Cesar Schneuwly
- J. Comput. Syst. Sci.
- 2012

Many problems of artificial intelligence, or more generally, many problems of information processing, have a generic solution based on local computation on join trees or acyclic hypertrees. There are several variants of this method all based on the algebraic structure of valuation algebras. A strong requirement underlying this approach is that the elements… (More)

- Marc Pouly, Jürg Kohlas
- 2007

It has been known for a long time that solving optimization problems by use of local computation techniques reduces to non-serial dynamic programming. Therefore, the valuation algebra axioms constitute in some way also the mathematical justification of dynamic programming. This paper builds up the corresponding theory from the more general perspective of… (More)

- Barbara Kordy, Marc Pouly, Patrick Schweitzer
- Inf. Sci.
- 2016

This work provides a computational framework for meaningful probabilistic evaluation of attack–defense scenarios involving dependent actions. We combine the graphical security modeling technique of attack–defense trees with probabilistic information expressed in terms of Bayesian networks. In order to improve the efficiency of probability computations on… (More)