Using equivalences of worlds for aggregation semantics of relational conditionals

  • Authors:
  • Marc Finthammer;Christoph Beierle

  • Affiliations:
  • Department of Computer Science, FernUniversität in Hagen, Hagen, Germany;Department of Computer Science, FernUniversität in Hagen, Hagen, Germany

  • Venue:
  • KI'12 Proceedings of the 35th Annual German conference on Advances in Artificial Intelligence
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

For relational probabilistic conditionals, the so-called aggregation semantics has been proposed recently. Applying the maximum entropy principle for reasoning under aggregation semantics requires solving a complex optimization problem. Here, we improve an approach to solving this optimization problem by Generalized Iterative Scaling (GIS). After showing how the method of Lagrange multipliers can also be used for aggregation semantics, we exploit that possible worlds are structurally equivalent with respect to a knowledge base $\mathcal R$ if they have the same verification and falsification properties. We present a GIS algorithm operating on the induced equivalence classes of worlds; its implementation yields significant performance improvements.