Automata-driven indexing of prolog clauses

DOI10.1016/0743-1066(94)00016-YMaRDI QIDQ3125095zbMATH OpenFDO

Authors

Publication date 17 March 1997

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(94)00016-Y

zbMATH Keywords

indexing techniquesProlog clauses

Mathematics Subject Classification ID

Logic programming (68N17) Formal languages and automata (68Q45)

Recommendations

• Pre-indexed Terms for Prolog
• Some global optimizations for a PROLOG compiler
• scientific article; zbMATH DE number 1746028
• Extended path-indexing
• Simple and Efficient Clause Subsumption with Feature Vector Indexing

Cited in

(3)

• Tight complexity bounds for term matching problems
• Efficient instance retrieval with standard and relational path indexing
• Pre-indexed Terms for Prolog

This page was built for publication: Automata-driven indexing of prolog clauses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3125095)