Sciweavers

835 search results - page 79 / 167
» Nonmonotonic Reasoning in Probabilistics
Sort
View
LICS
1998
IEEE
15 years 10 months ago
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
Eugene W. Stark, Scott A. Smolka
JAIR
2010
145views more  JAIR 2010»
15 years 4 months ago
Planning with Noisy Probabilistic Relational Rules
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
Tobias Lang, Marc Toussaint
ESORICS
2005
Springer
15 years 12 months ago
Quantifying Probabilistic Information Flow in Computational Reactive Systems
Information flow and non-interference are well-established techniques for expressing both integrity and privacy properties. Because of the enormous potential to transmit informati...
Michael Backes
ASIAN
2003
Springer
170views Algorithms» more  ASIAN 2003»
15 years 11 months ago
Model Checking Probabilistic Distributed Systems
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
Benedikt Bollig, Martin Leucker
AAAI
2011
14 years 6 months ago
Abductive Markov Logic for Plan Recognition
Plan recognition is a form of abductive reasoning that involves inferring plans that best explain sets of observed actions. Most existing approaches to plan recognition and other ...
Parag Singla, Raymond J. Mooney