Efficient query processing with reduced implicate tries
type: Item
instance of: scholarly article
title: Efficient query processing with reduced implicate tries
zbMATH Open document ID: 1113.68044
author: Neil V. Murray
author: Erik Rosenthal
published in: Journal of Automated Reasoning
publication date: 2007-05-04T00:00:00Z
Mathematics Subject Classification ID: 68P20
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68T30
zbMATH DE Number: 5149286
zbMATH Keywords: knowledge compilation
describes a project that uses: PATRICIA
MaRDI profile type: Publication
full work available at URL: s10817-006-9054-x
OpenAlex ID: W2002443204
cites work: Decomposable negation normal form
cites work: Knowledge compilation using the extension rule
cites work: Normal Forms for Knowledge Compilation
cites work: Q4264736
cites work: Hard problems for simple default logics
cites work: An incremental method for generating prime implicants/implicates
cites work: Dissolution
cites work: Duality in Knowledge Compilation Techniques
cites work: Automated Reasoning with Analytic Tableaux and Related Methods
cites work: An algorithm to compute circumscription
cites work: CNF and DNF considered harmful for computing prime implicants/implicates
cites work: A theory of diagnosis from first principles
cites work: Knowledge compilation and theory approximation
cites work: A New Algorithm for Generating Prime Implicants
cites work: Polynomial-time algorithms for generation of prime implicants
DOI: 10.1007/S10817-006-9054-X
description: scientific article; zbMATH DE number 5149286