Gries, OliverOliverGries2022-01-242022-01-242011-12-265th international workshop, MIWAI 2011, Hyderabad, India, December 7 - 9, 2011 ; proceedings. - (Lecture Notes in Computer Science ; Vol. 7080 LNAI). - Seite 418-427 (2011)http://hdl.handle.net/11420/11541There is a growing interest in the logical representation of both probabilistic and deterministic dependencies. While Gibbs sampling is a widely-used method for estimating probabilities, it is known to give poor results in the presence of determinism. In this paper, we consider acyclic Horn logic, a small, but significant fragment of first-order logic and show that Markov chains constructed with Gibbs sampling remain ergodic with deterministic dependencies specified in this fragment. Thus, there is a new subclass of Gibbs sampling procedures known to approximate the correct probabilities and expected to be useful for lots of applications. © 2011 Springer-Verlag.enDeterministic DependenciesGibbs SamplingMarkov NetworksProbabilistic InferenceInformatikConference Paper10.1007/978-3-642-25725-4_37Other