Efficient query processing with reduced implicate tries
From MaRDI portal
Publication:877893
Recommendations
Cites work
- scientific article; zbMATH DE number 1348482 (Why is no real title available?)
- A New Algorithm for Generating Prime Implicants
- A theory of diagnosis from first principles
- An algorithm to compute circumscription
- An incremental method for generating prime implicants/implicates
- Automated Reasoning with Analytic Tableaux and Related Methods
- CNF and DNF considered harmful for computing prime implicants/implicates
- Decomposable negation normal form
- Dissolution
- Duality in Knowledge Compilation Techniques
- Hard problems for simple default logics
- Knowledge compilation and theory approximation
- Knowledge compilation using the extension rule
- Normal Forms for Knowledge Compilation
- Polynomial-time algorithms for generation of prime implicants
- Tableaux, path dissolution, and decomposable negation normal form for knowledge compilation
Cited in
(6)
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)