Implementing weighted abduction in Markov logic

  • Authors:
  • James Blythe;Jerry R. Hobbs;Pedro Domingos;Rohit J. Kate;Raymond J. Mooney

  • Affiliations:
  • USC ISI;USC ISI;University of Washington;University of Wisconsin-Milwaukee;University of Texas at Austin

  • Venue:
  • IWCS '11 Proceedings of the Ninth International Conference on Computational Semantics
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Abduction is a method for finding the best explanation for observations. Arguably the most advanced approach to abduction, especially for natural language processing, is weighted abduction, which uses logical formulas with costs to guide inference. But it has no clear probabilistic semantics. In this paper we propose an approach that implements weighted abduction in Markov logic, which uses weighted first-order formulas to represent probabilistic knowledge, pointing toward a sound probabilistic semantics for weighted abduction. Application to a series of challenge problems shows the power and coverage of our approach.