Propositional Abduction is Almost Always Hard

@inproceedings{Nordh2005PropositionalAI,
  title={Propositional Abduction is Almost Always Hard},
  author={Gustav Nordh and Bruno Zanuttini},
  booktitle={IJCAI},
  year={2005}
}
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. Applications of this process range from car configuration to medical diagnosis. We study here its computational complexity in the case where the application domain is described by a propositional theory built upon a fixed constraint… CONTINUE READING