scientific article; zbMATH DE number 3945370

zbMATH Open0588.68044MaRDI QIDQ3716319FDOQ3716319

Authors: Georg Gottlob, Alexander Leitsch 

Publication date: 1985

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

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

zbMATH Keywords

exponential lower boundpolynomial timeDivision into Componentsimproved DCsubsumption algorithm DC

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (14)

• Quantifying sequential subsumption
• Speeding up the GVW algorithm via a substituting method
• Title not available (Why is that?)
• Removing redundancy from a clause
• Title not available (Why is that?)
• Fast Evaluation of Union-Intersection Expressions
• Title not available (Why is that?)
• Subsumption algorithms based on search trees
• On the efficiency of subsumption algorithms
• Title not available (Why is that?)
• Reduction rules for resolution-based systems
• AI*IA 2003: Advances in Artificial Intelligence
• Thue trees
• Subsumption and implication

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)