Reasoning with Models of Probabilistic Knowledge Over Probabilistic Knowledge

Download or read book Reasoning with Models of Probabilistic Knowledge Over Probabilistic Knowledge written by Afsaneh H. Shirazi and published by . This book was released on 2011 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: In multi-agent systems, the knowledge of agents about other agents0́9 knowledge often plays a pivotal role in their decisions. In many applications, this knowledge involves uncertainty. This uncertainty may be about the state of the world or about the other agents0́9 knowledge. In this thesis, we answer the question of how to model this probabilistic knowledge and reason about it efficiently. Modal logics enable representation of knowledge and belief by explicit reference to classical logical formulas in addition to references to those formulas0́9 truth values. Traditional modal logics (see e.g. [Fitting, 1993; Blackburn et al., 2007]) cannot easily represent scenarios involving degrees of belief. Works that combine modal logics and probabilities apply the representation power of modal operators for representing beliefs over beliefs, and the representation power of probability for modeling graded beliefs. Most tractable approaches apply a single model that is either engineered or learned, and reasoning is done within that model. Present model-based approaches of this kind are limited in that either their semantics is restricted to have all agents with a common prior on world states, or are resolving to reasoning algorithms that do not scale to large models. In this thesis we provide the first sampling-based algorithms for model-based reasoning in such combinations of modal logics and probability. We examine a different point than examined before in the expressivity-tractability tradeoff for that combination, and examine both general models and also models which use Bayesian Networks to represent subjective probabilistic beliefs of agents. We provide exact inference algorithms for the two representations, together with correctness results, and show that they are faster than comparable previous ones when some structural conditions hold. We also present sampling-based algorithms, show that those converge under relaxed conditions and that they may not converge otherwise, demonstrate the methods on some examples, and examine the performance of our algorithms experimentally.