Identifying prime implicate branches in reduced implicate tries

DOI10.3233/FI-2010-247MaRDI QIDQ3568273zbMATH OpenOpenAlexFDO

Authors Neil V. Murray, Erik Rosenthal

Publication date 17 June 2010

Full work available at URL https://content.iospress.com/articles/fundamenta-informaticae/fi99-2-07

zbMATH Keywords

knowledge compilationprime implicatesreduced implicate tries

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Prime implicate tries
• Updating Reduced Implicate Tries
• Reduced Implicate Tries with Updates
• Computing prime implicates by pruning the search space and accelerating subsumption
• Efficient query processing with reduced implicate tries

Cited in

(6)

• An SE-tree-based prime implicant generation algorithm
• Computing prime implicates by pruning the search space and accelerating subsumption
• Reduced Implicate Tries with Updates
• Prime implicate tries
• Updating Reduced Implicate Tries
• Efficient query processing with reduced implicate tries

This page was built for publication: Identifying prime implicate branches in reduced implicate tries

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