Thanks for your response. We're writing "event" documents into
essentially the facts on which we want rules to execute. So I do mean
access. At this
On Jan 6, 2:14 pm, Chris Westin <
cwes...@yahoo.com> wrote:
> Caveat: it's been about 30 years since I wrote any prolog, so my
> knowledge of what you can do with prolog engines today may be out of
> date.
>
> My recollection is that you do two things in prolog: you specify a
> bunch of facts, which amount to a number of tuples. Then you can ask
> the engine if propositions are satisfied by those facts. In very
> simple terms, it does a sort of search across the facts -- if the
> facts are kept internally as a tree, it might amount to doing some
> kind of recursive backtracking algorithm to find facts that support
> the proposition.
>
> Can you be more specific about what you mean by "working memory?" Do
> you mean to store the facts? Are there prolog engines that support
> external persistent fact storage these days? When I saw these, you
> put all your facts in a file that had to be loaded before you could
> make propositions.
>
> Or, by "working memory," do you mean the memory used during the
> execution of the "search" for facts that support the proposition?
>
> I don't know of anything offhand, so I did a Google search, and found