Concurrency in Prolog using threads and a shared database

摘要: Concurrency in Logic Programming has received much attention the past. One problem with many proposals, when applied to Prolog, is that they involve large modifications standard implementations, and/or communication and synchronization facilities provided do not fit as naturally within language model we feel possible. In this paper propose a new mechanism for implementing concurrency, based on atomic accesses designated facts (shared) database. We argue comparatively easy implement harmonizes better than previous proposals Prolog control and standard set of built-ins. show how proposed it express classical concurrency algorithms subsume other mechanisms such Linda, variable-based communication, or parallelism-oriented primitives. also report an implementation provide performance resource consumption data.