Sciweavers

100 search results - page 2 / 20
» Foundations of Attack-Defense Trees
Sort
View
ENTCS
2002
78views more  ENTCS 2002»
13 years 4 months ago
Theoretical Foundations of Value Withdrawal Explanations for Domain Reduction
Solvers on finite domains use local consistency notions to remove values from the domains. This paper defines value withdrawal explanations. Domain reduction is formalized with ch...
Gérard Ferrand, Willy Lesaint, Alexandre Te...
IPMU
1994
Springer
13 years 9 months ago
Philosophical Foundations for Causal Networks
Bayes nets are seeing increasing use in expert systems [2, 6], and structural equations models continue to be popular in many branches of the social sciences [1]. Both types of mod...
Glenn Shafer
SCP
2010
154views more  SCP 2010»
13 years 3 months ago
An algebraic foundation for automatic feature-based program synthesis
Feature-Oriented Software Development provides a multitude of formalisms, methods, languages, and tools for building variable, customizable, and extensible software. Along differe...
Sven Apel, Christian Lengauer, Bernhard Mölle...
AAAI
2007
13 years 7 months ago
Macroscopic Models of Clique Tree Growth for Bayesian Networks
In clique tree clustering, inference consists of propagation in a clique tree compiled from a Bayesian network. In this paper, we develop an analytical approach to characterizing ...
Ole J. Mengshoel
BIRTHDAY
1992
Springer
13 years 9 months ago
Single Tree Grammars
A context-free grammar is a single-tree grammar (STG) if every nonterminal symbol has at most one production rule whose right hand side contains nonterminal symbols. Various prope...
Sheila A. Greibach, Weiping Shi, Shai Simonson