Sciweavers

Share
AAAI
2008

Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation

9 years 3 months ago
Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation
Abductive diagnosis is an important method to identify explanations for a given set of observations. Unfortunately, most of the algorithmic problems in this area are intractable. We have recently shown (Gottlob, Pichler, and Wei 2006) that these problems become tractable if the underlying clausal theory has bounded treewidth. However, turning these theoretical tractability results into practically efficient algorithms turned out to be very problematical. In (Gottlob, Pichler, and Wei 2007), we have established a new method based on monadic datalog which remedies this unsatisfactory situation. Specifically, we designed an efficient algorithm for a strongly related problem in the database area. In the current paper, we show that these favorable results can be carried over to logic-based abduction.
Georg Gottlob, Reinhard Pichler, Fang Wei
Added 02 Oct 2010
Updated 02 Oct 2010
Type Conference
Year 2008
Where AAAI
Authors Georg Gottlob, Reinhard Pichler, Fang Wei
Comments (0)
books