31 search results - page 3 / 7 » A Graph Abstract Machine Describing Event Structure Composit... |
AIPS
1996
13 years 7 months ago
1996
An increasing number of planners can handle uncertainty in the domain or in action outcomes. However, less work has addressed building plans when the planner's world can chan...
CAI
2009
Springer
14 years 27 days ago
2009
Springer
Abstract. GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handlin...
POPL
2000
ACM
13 years 10 months ago
2000
ACM
with existing analysis tools. Modular reasoning principles such as abstraction, compositional refinement, and assume-guarantee reasoning are well understood for architectural hiera...
ATVA
2007
Springer
14 years 15 days ago
2007
Springer
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
ESOP
2011
Springer
12 years 9 months ago
2011
Springer
Abstract. The Bayesian approach to machine learning amounts to inferring posterior distributions of random variables from a probabilistic model of how the variables are related (th...