References of "Pouly, Marc 40000543"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailA Probabilistic Framework for Security Scenarios with Dependent Actions
Kordy, Barbara UL; Schweitzer, Patrick UL; Pouly, Marc UL

in The 11th International Conference on Integrated Formal Methods (iFM'14), Bertinoro, Italy (2014)

Detailed reference viewed: 79 (1 UL)
See detailGeneric Inference A Unifying Theory for Automated Reasoning
Pouly, Marc UL; Kohlas, Jürg

Book published by John Wiley & Sons (2011)

This book provides a rigorous algebraic study of the most popular inference formalisms with a special focus on their wide application area, showing that all these tasks can be performed by a single ... [more ▼]

This book provides a rigorous algebraic study of the most popular inference formalisms with a special focus on their wide application area, showing that all these tasks can be performed by a single generic inference algorithm. Written by the leading international authority on the topic, it includes an algebraic perspective (study of the valuation algebra framework), an algorithmic perspective (study of the generic inference schemes) and a "practical" perspective (formalisms and applications). Researchers in a number of fields including artificial intelligence, operational research, databases and other areas of computer science; graduate students; and professional programmers of inference methods will benefit from this work. [less ▲]

Detailed reference viewed: 78 (0 UL)
Full Text
See detailGeneric Local Computation
Pouly, Marc UL; Schneuwly, Cesar; Kohlas, Jürg

Report (2011)

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 ... [more ▼]

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 a valuation algebra. A strong requirement underlying this approach is that the elements of a problem decomposition form a join tree. Although it is always possible to construct covering join trees, if the requirement is originally not satisfied, it is not always possible or not efficient to extend the elements of the decomposition to the covering join tree. Therefore in this paper different variants of an axiomatic framework of valuation algebras are introduced which prove sufficient for local computation without the need of an extension of the factors of a decomposition. This framework covers the axiomatic system proposed by (Shenoy & Shafer, 1990). A particular emphasis is laid on the important special cases of idempotent algebras and algebras with some notion of division. It is shown that all well-known architectures for local computation like the Shenoy-Shafer architecture, Lauritzen-Spiegelhalter and HUGIN architectures may be adapted to this new framework. Further a new architecture for idempotent algebras is presented. As examples, in addition to the classical instances of valuation algebras, semiring induced valuation algebras, Gaussian potentials and the relational algebra are presented. [less ▲]

Detailed reference viewed: 79 (0 UL)
See detailGeneralized Information Theory based on the Theory of Hints
Pouly, Marc UL

in Liu, Weiru (Ed.) Symbolic and Quantitative Approaches to Reasoning with Uncertainty (2011)

The aggregate uncertainty is the only known functional for Dempster-Shafer theory that generalizes the Shannon and Hartley mea- sures and satis?es all classical requirements for uncertainty measures ... [more ▼]

The aggregate uncertainty is the only known functional for Dempster-Shafer theory that generalizes the Shannon and Hartley mea- sures and satis?es all classical requirements for uncertainty measures, including subadditivity. Although being posed several times in the liter- ature, it is still an open problem whether the aggregate uncertainty is unique under these properties. This paper derives an uncertainty measure based on the theory of hints and shows its equivalence to the pignistic entropy. It does not satisfy subadditivity, but the viewpoint of hints un- covers a weaker version of subadditivity. On the other hand, the pignistic entropy has some crucial advantages over the aggregate uncertainty. i.e. explicitness of the formula and sensitivity to changes in evidence. We observe that neither of the two measures captures the full uncertainty of hints and propose an extension of the pignistic entropy called hints en- tropy that satis?es all axiomatic requirements, including subadditivity, while preserving the above advantages over the aggregate uncertainty. [less ▲]

Detailed reference viewed: 73 (2 UL)
See detailGeneric Solution Construction in Valuation-Based Systems
Pouly, Marc UL

in Butz, Cory; Lingras, Pawan (Eds.) Advances in Artificial Intelligence (2011)

Valuation algebras abstract a large number of formalisms for automated reasoning and enable the definition of generic inference procedures. Many of these formalisms provide some notions of solutions ... [more ▼]

Valuation algebras abstract a large number of formalisms for automated reasoning and enable the definition of generic inference procedures. Many of these formalisms provide some notions of solutions. Typical examples are satisfying assignments in constraint systems, models in logics or solutions to linear equation systems. Contrary to inference, there is no general algorithm to compute solutions in arbitrary valuation algebras. This paper states formal requirements for the presence of solutions and proposes a generic algorithm for solution construction based on the results of a previously executed inference scheme. We study the application of generic solution construction to semiring constraint systems, sparse linear systems and algebraic path problems and show that the proposed method generalizes various existing approaches for specific formalisms in the literature. [less ▲]

Detailed reference viewed: 95 (1 UL)
Full Text
Peer Reviewed
See detailComputational Aspects of Attack-Defense Trees
Kordy, Barbara UL; Pouly, Marc UL; Schweitzer, Patrick UL

in Security and Intelligent Information Systems - International Joint Conferences, SIIS 2011, Warsaw, Poland, June 13-14, 2011, Revised Selected Papers (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 ... [more ▼]

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 attack trees with defense nodes does not increase the computational complexity. This implies that, for these semantics, every query that can be solved efficiently on attack trees can also be solved efficiently on attack-defense trees. Furthermore, every algorithm for attack trees can directly be used to process attack-defense trees. [less ▲]

Detailed reference viewed: 73 (3 UL)