Automata-driven indexing of Prolog clauses

Authors:
R. Ramesh;I. V. Ramakrishnan;D. S. Warren
Affiliations:
Department of Computer Science, University of Texas at Dallas, Richardson, TX;Department of Computer Science, State University of New York at Stony Brook, Stony Brook, NY;Department of Computer Science, State University of New York at Stony Brook, Stony Brook, NY
Venue:
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Year:
1989

Citing 5
Cited 12

A superimposed codeword indexing scheme for very large Prolog databases

Proceedings on Third international conference on logic programming
A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
Pattern Matching in Trees

Journal of the ACM (JACM)
An Efficient Unification Algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient string matching: an aid to bibliographic search

Communications of the ACM

Unification factoring for efficient execution of logic programs

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Principles and practice of unification factoring

ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel execution of prolog programs: a survey

ACM Transactions on Programming Languages and Systems (TOPLAS)
A High-Level Petri Net for Goal-Directed Semantics of Horn Clause Logic

IEEE Transactions on Knowledge and Data Engineering
Term indexing

Handbook of automated reasoning
Efficient instance retrieval with standard and relational path indexing

Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Stack splitting: a technique for efficient exploitation of search parallelism on share-nothing platforms

Journal of Parallel and Distributed Computing
The design and implementation of VAMPIRE

AI Communications - CASC
Fast Packet Classification Using Condition Factorization

ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Higher-order term indexing using substitution trees

ACM Transactions on Computational Logic (TOCL)
Experiments with associative-commutative discrimination nets

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Efficient instance retrieval with standard and relational path indexing

Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Indexing Prolog clauses is an important optimization step that reduces the number of clauses on which unification will be performed and can avoid the pushing of a choice point. It is quite desirable to increase the number of functors used in indexing as this can considerably reduce the size of the filtered set. However this can cause an enormous increase in running time if indexing is done naively. This paper describes a new technique for indexing that utilizes all the functors in a clause-head. More importantly, in spite of using all the functors, this technique is still able to quickly select relevant clause-heads at run time. This is made possible primarily by a finite-state automaton that guides the indexing process. The automaton is constructed at compile time by preprocessing all the clause-heads.