scientific article; zbMATH DE number 140373

MaRDI QIDQ4028775zbMATH OpenFDO

Authors Tom Bylander

Publication date 28 March 1993

zbMATH Keywords

best explanationcomposite hypothesismonotonic abduction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 4166861
• scientific article; zbMATH DE number 512816
• The computational complexity of abduction
• What makes propositional abduction tractable
• A Complete Classification of the Complexity of Propositional Abduction

Cited in

(4)

• Abduction from logic programs: Semantics and complexity
• Semantics and complexity of abduction from default theories
• Tractable reasoning via approximation
• On some tractable classes in deduction and abduction

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 Q4028775)