On some tractable classes in deduction and abduction

Decomposable negation normal form

Journal of the ACM (JACM)

Automated Abduction

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II

Theorem Proving Based on the Extension Rule

Journal of Automated Reasoning

Complexity results for explanations in the structural-model approach

Artificial Intelligence

Knowledge Compilation Using the Extension Rule

Journal of Automated Reasoning

Compilability of propositional abduction

ACM Transactions on Computational Logic (TOCL)

On computing all abductive explanations from a propositional Horn theory

Journal of the ACM (JACM)

What makes propositional abduction tractable

Artificial Intelligence

Propositional abduction is almost always hard

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

Counting complexity of propositional abduction

Journal of Computer and System Sciences