524 search results - page 12 / 105 » Temporal reachability graphs |
112
click to vote
FSEN
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over...
149
Voted
FSTTCS
2010
Springer
15 years 1 months ago
2010
Springer
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...
155
click to vote
AIPS
2006
15 years 4 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
135
click to vote
AI
2008
Springer
15 years 3 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
113
click to vote
EMNLP
2006
15 years 4 months ago
2006
We consider the problem of constructing a directed acyclic graph that encodes temporal relations found in a text. The unit of our analysis is a temporal segment, a fragment of tex...