scientific article; zbMATH DE number 4166861

MaRDI QIDQ3493231zbMATH OpenFDO

Authors Tom Bylander, Dean Allemang, Michael C. Tanner, John R. Josephson

Publication date 1989

zbMATH Keywords

computational complexityabduction

Mathematics Subject Classification ID

Medical applications (general) (92C50) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The computational complexity of abduction
• What makes propositional abduction tractable
• scientific article; zbMATH DE number 512816
• Complexity results for abductive logic programming
• The complexity of logic-based abduction

Cited in

(9)

• A measure of arbitrariness in abductive explanations
• Horn approximations of empirical data
• The Complexity of Abduction for Equality Constraint Languages
• Controlling the complexity in model-based diagnosis
• On the complexity of second-best abductive explanations
• Counting complexity of propositional abduction
• The computational complexity of abduction
• Using Abduction to Compute Efficient Proofs
• scientific article; zbMATH DE number 140373 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3493231)