scientific article; zbMATH DE number 4166861

zbMATH Open0709.68021MaRDI QIDQ3493231FDOQ3493231

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

Publication date: 1989

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

computational complexityabduction

Mathematics Subject Classification ID

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

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
• Title not available (Why is that?)

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)