scientific article; zbMATH DE number 3945370

MaRDI QIDQ3716319zbMATHFDO

Authors Georg Gottlob, Alexander Leitsch

Publication date 1985

zbMATH Keywords

exponential lower boundpolynomial timeDivision into Componentsimproved DCsubsumption algorithm DC

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the efficiency of subsumption algorithms
• scientific article; zbMATH DE number 970722
• scientific article; zbMATH DE number 4072424
• Subsumption algorithms based on search trees
• AI*IA 2003: Advances in Artificial Intelligence

Cited in

(14)

• Speeding up the GVW algorithm via a substituting method
• Quantifying sequential subsumption
• Subsumption and implication
• scientific article; zbMATH DE number 4072424 (Why is no real title available?)
• Fast Evaluation of Union-Intersection Expressions
• Reduction rules for resolution-based systems
• On the efficiency of subsumption algorithms
• scientific article; zbMATH DE number 1253989 (Why is no real title available?)
• Removing redundancy from a clause
• scientific article; zbMATH DE number 140374 (Why is no real title available?)
• Subsumption algorithms based on search trees
• scientific article; zbMATH DE number 1545003 (Why is no real title available?)
• Thue trees
• AI*IA 2003: Advances in Artificial Intelligence

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