Counting Complexity of Propositional Abduction

Abduction is an important method of non-monotonic reasoning with many applications in artificial intelligence and related topics. In this paper, we concentrate on propositional abduction, where the background knowledge is given by a propositional formula. We have recently started to study the counting complexity of propositional abduction. However, several important cases have been left open, namely, the cases when we restrict ourselves to solutions with minimal cardinality or with minimal weight. These cases – possibly combined with priorities – are now settled in this paper. We thus arrive at a complete picture of the counting complexity of propositional abduction.

• Type: Conference
• Year: 2007
• Where: IJCAI
• Authors: Miki Hermann, Reinhard Pichler
• Keywords: Artificial Intelligence, Counting Complexity, IJCAI 2007, Propositional Abduction, Propositional Formula