Efficient access mechanisms for tabled logic programs
- 31 January 1999
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 38 (1) , 31-54
- https://doi.org/10.1016/s0743-1066(98)10013-4
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- An abstract machine for tabled execution of fixed-order stratified logic programsACM Transactions on Programming Languages and Systems, 1998
- Tabled evaluation with delaying for general logic programsJournal of the ACM, 1996
- Adaptive Pattern MatchingSIAM Journal on Computing, 1995
- Argument reduction by factoringTheoretical Computer Science, 1995
- A survey of deductive database systemsThe Journal of Logic Programming, 1995
- The anatomy of vampireJournal of Automated Reasoning, 1995
- Multistage indexing algorithms for speeding prolog executionSoftware: Practice and Experience, 1994
- Experiments with discrimination-tree indexing and path indexing for term retrievalJournal of Automated Reasoning, 1992
- Negation as failure using tight derivations for general logic programsThe Journal of Logic Programming, 1989
- The Complexity of Trie Index ConstructionJournal of the ACM, 1977