AAAI Publications, The Thirty-Third International Flairs Conference

Font Size: 
Solving Weighted Abduction via Max-SAT Solvers
Yoichi Sasaki, Takanori Maehara, Takumi Akazaki, Kazeto Yamamoto, Kunihiko Sadamasa

Last modified: 2020-05-05

Abstract


Abduction is a form of inference that seeks the best explanation for the given observation. Because it provides a reasoning process based on background knowledge, it is used in applications that need convincing explanations. In this study, we consider weighted abduction, which is one of the commonly used mathematical models for abduction. The main difficulty associated with applying weighted abduction to real problems is its computational complexity. A state-of-the-art method formulates weighted abduction as an integer linear programming (ILP) problem and solves it using efficient ILP solvers; however, it is still limited to solving problems that include at most 100 rules of background knowledge and observations. In this study, we first formulate the weighted abduction problem as a Max-SAT problem whose hard clauses are mostly Horn clauses. Then, we propose to solve the problem using modern Max-SAT solvers. In our experiments, the proposed method solved the problems much faster than the state-of-the-art ILP-based weighted abduction.


Full Text: PDF