Causes for events: their computation and applications
Proc. of the 8th international conference on Automated deduction
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Artificial Intelligence - Special volume on natural language processing
Cost-based abduction and MAP explanation
Artificial Intelligence
Machine Learning
Introduction to Statistical Relational Learning (Adaptive Computation and Machine Learning)
Introduction to Statistical Relational Learning (Adaptive Computation and Machine Learning)
A knowledge-level account of abduction
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
On the mechanization of abductive logic
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Markov Logic: An Interface Layer for Artificial Intelligence
Markov Logic: An Interface Layer for Artificial Intelligence
Abductive reasoning with a large knowledge base for discourse processing
IWCS '11 Proceedings of the Ninth International Conference on Computational Semantics
Targeted risk communication for computer security
Proceedings of the 16th international conference on Intelligent user interfaces
Elaborating a knowledge base for deep lexical semantics
IWCS '11 Proceedings of the Ninth International Conference on Computational Semantics
Abductive plan recognition by extending Bayesian logic programs
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part II
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Discriminative learning of first-order weighted abduction from partial discourse explanations
CICLing'13 Proceedings of the 14th international conference on Computational Linguistics and Intelligent Text Processing - Volume Part I
Hi-index | 0.00 |
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.