Efficient query processing with reduced implicate tries

DOI10.1007/s10817-006-9054-xzbMath1113.68044OpenAlexW2002443204MaRDI QIDQ877893

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

zbMATH Keywords

knowledge compilation

Mathematics Subject Classification ID

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

Uses Software

• PATRICIA

Cites Work

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

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