Efficient query processing with compiled knowledge bases

Authors:
Neil V. Murray;Erik Rosenthal
Affiliations:
Department of Computer Science, State University of New York, Albany, NY;Department of Mathematics, University of New Haven, West Haven, CT
Venue:
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Year:
2005

Citing 39
Cited 5

Model-based recognition in robot vision

ACM Computing Surveys (CSUR)
Inference with path resolution and semantic graphs

Journal of the ACM (JACM)
A theory of diagnosis from first principles

Artificial Intelligence
An algorithm to compute circumscription

Artificial Intelligence
An incremental method for generating prime implicants/implicates

Journal of Symbolic Computation
Computing prime implicants

CADE-10 Proceedings of the tenth international conference on Automated deduction
Implicit and incremental computation of primes and essential primes of Boolean functions

DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys (CSUR)
Polynomial-time algorithms for generation of prime implicants

Journal of Complexity
Building problem solvers

Building problem solvers
Dissolution: making paths vanish

Journal of the ACM (JACM)
On the relative merits of path dissolution and the method of analytic tableaux

Theoretical Computer Science
Graph driven BDDs—a new data structure for Boolean functions

Theoretical Computer Science
Knowledge compilation and theory approximation

Journal of the ACM (JACM)
First-order logic and automated theorem proving (2nd ed.)

First-order logic and automated theorem proving (2nd ed.)
Boosting combinatorial search through randomization

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric

Journal of the ACM (JACM)
On Matrices with Connections

Journal of the ACM (JACM)
Decomposable negation normal form

Journal of the ACM (JACM)
Principles of Database Systems

Principles of Database Systems
CNF and DNF Considered Harmful for Computing Prime Implicants/Implicates

Journal of Automated Reasoning
A General Framework for Knowledge Compilation

PDK '91 Proceedings of the International Workshop on Processing Declarative Knowledge
Computing Prime Implicates Incrementally

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
D-trie: A new data structure for a collection of minimal sets

D-trie: A new data structure for a collection of minimal sets
Some applications of non clausal deduction

Some applications of non clausal deduction
Knowledge Compilation Using the Extension Rule

Journal of Automated Reasoning
Automated theorem proving: A logical basis (Fundamental studies in computer science)

Automated theorem proving: A logical basis (Fundamental studies in computer science)
A survey on knowledge compilation

AI Communications
A New Algorithm for Generating Prime Implicants

IEEE Transactions on Computers
Model-based diagnosis using structured system descriptions

Journal of Artificial Intelligence Research
A knowledge compilation map

Journal of Artificial Intelligence Research
A new algorithm for incremental prime implicate generation

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Ten challenges in propositional reasoning and search

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Knowledge compilation using theory prime implicates

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Found ations of assumption-based truth maintenance systems: preliminary report

AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
Focusing on probable diagnoses

AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 2
An improved incremental algorithm for generating prime implicates

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Duality in knowledge compilation techniques

ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems

Updating Reduced Implicate Tries

TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Prime Implicates and Reduced Implicate Tries

ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Prime Implicate Tries

TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Reduced implicate/implicant tries

ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
Identifying Prime Implicate Branches in Reduced Implicate Tries

Fundamenta Informaticae - Methodologies for Intelligent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The goal of knowledge compilation is to enable fast queries. Prior approaches had the goal of small (i.e., polynomial in the size of the initial knowledge bases) compiled knowledge bases. Typically, query-response time is linear, so that the efficiency of querying the compiled knowledge base depends on its size. In this paper, a target for knowledge compilation called the ri-trie is introduced; it has the property that even if they are large they nevertheless admit fast queries. Specifically, a query can be processed in time linear in the size of the query regardless of the size of the compiled knowledge base.