This post assumes that you know the basics of Pilog (PicoLisp Prolog). If you don't, consider to read this article series first. All Pilog access to database objects is done via the two predicates db/3 and select/3 (/3 means that these predicates ta...
This task is actually not included in the Rosetta code, but still it is a quite frequent algorithmic task: How to find the optimal path between two nodes of a graph. In this post, we will show a brute-force solution using Pilog to get from A to B. A...
The original task is from the book "Superior Mathematical Puzzles" from Howard P. Dinesman. The Task Baker, Cooper, Fletcher, Miller, and Smith live on different floors of an apartment house that contains only five floors. Baker does not live on t...
"98% of the world population cannot solve this task." (Fake quote attributed to Albert Einstein)
Implemented in Logical and Functional Programming
In the last seven posts we introduced the main concepts and syntax of Pilog. However, all the queries were only done in interactive mode from the REPL. So how do we use it from PicoLisp? Calling Pilog from Lisp and vice versa The interface from Pico...
