Efficient query processing with reduced implicate tries

DOI10.1007/S10817-006-9054-XzbMATH Open1113.68044OpenAlexW2002443204MaRDI QIDQ877893FDOQ877893

Erik Rosenthal, Neil V. Murray

Publication date: 4 May 2007

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-006-9054-x

Recommendations

• Automated Reasoning with Analytic Tableaux and Related Methods
• Updating Reduced Implicate Tries
• Reduced Implicate Tries with Updates
• Identifying prime implicate branches in reduced implicate tries
• scientific article; zbMATH DE number 1946853

zbMATH Keywords

knowledge compilation

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05) Knowledge representation (68T30)

Cites Work

• A theory of diagnosis from first principles
• Knowledge compilation and theory approximation
• An algorithm to compute circumscription
• Decomposable negation normal form
• Title not available (Why is that?)
• Hard problems for simple default logics
• A New Algorithm for Generating Prime Implicants
• CNF and DNF considered harmful for computing prime implicants/implicates
• An incremental method for generating prime implicants/implicates
• Dissolution
• Knowledge compilation using the extension rule
• Duality in Knowledge Compilation Techniques
• Polynomial-time algorithms for generation of prime implicants
• Automated Reasoning with Analytic Tableaux and Related Methods
• Normal Forms for Knowledge Compilation
• Automated Reasoning with Analytic Tableaux and Related Methods

Cited In (3)

• Reduced Implicate Tries with Updates
• Knowledge compilation using the extension rule
• Efficient and optimal query answering on independent schemes

Uses Software

• PATRICIA

This page was built for publication: Efficient query processing with reduced implicate tries

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