A Low-Level Index for Distributed Logic Programming
This addresses indexing and unification bottlenecks for distributed logic programming systems, but appears incremental as it builds on existing methods.
The paper tackled the problem of implementing a versatile and stable data structure for indexing many expressions in distributed logic programming, and it reduced the number of occur checks in Robinson's unification algorithm using low-level programming.
A distributed logic programming language with support for meta-programming and stream processing offers a variety of interesting research problems, such as: How can a versatile and stable data structure for the indexing of a large number of expressions be implemented with simple low-level data structures? Can low-level programming help to reduce the number of occur checks in Robinson's unification algorithm? This article gives the answers.