Bckwrd is a proof-of-concept implementation of an inference engine that does backwards chaining to evaluate queries. The idea here is to use the A* search algorithm instead of DFS (which Prolog uses). Bckwrd is written in Go to make use of it's efficiency (mainly pointers) which should speed up evaluation.
-
Notifications
You must be signed in to change notification settings - Fork 0
POC implementation of an inference engine that uses A*
License
ninesalt/bckwrd
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
POC implementation of an inference engine that uses A*
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published