This paper describes new and efficient indexing techniques that utilize all the functors in the clause heads and the goal.
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 ...
Indexing Prolog clauses is an important optimization step that reduces the number of clauses on which uni- fication will be performed and can avoid the ...
This method, which we will refer to as trie based indexing, is suited for Prolog programs in which the number of clause heads with the same predicate name does.
A new technique for indexing that utilizes all the functors in a clause-head and is still able to quickly select relevant clause-heads at run time is ...
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev. Hosted as a part of SLEBOK on ...
Automata-driven indexing of prolog clauses. Ramesh, R.; Ramakrishnan, V.; Warren, D.S.. The Journal of Logic Programming 23(2): 152-202. 1995. ISSN/ISBN: 0743 ...
More specifically, we present a small extension to the WAM that allows for flexible indexing of Prolog clauses during runtime based on actual demand. For static ...
Missing: Automata- | Show results with:Automata-
We have implemented demand-driven indexing in two different Prolog systems and have been able to obtain non-negligible performance speedups: from a few percent ...
Missing: Automata- | Show results with:Automata-
Abstract. Indexing of terms and clauses is a well-known technique used in Prolog implementations (as well as automated theorem provers) to speed up search.
Missing: Automata- | Show results with:Automata-