A.I. programming in Prolog and Assembler – Just another WordPress.com weblog

DeepSeek on SWI-Prolog initialisation

DeepSeek provided useful information on a simple SWI-Prolog issue, but…not without my corrections.
DeepSeek on implementing classic Prolog Unification (of variables) encoded in bits

Implementing Prolog unification with bit-encoded data combines symbolic reasoning with low-level bit manipulation.
DeepSeek on how to make logical inferences using bit-encoded data

DeepSeek confirmed and explained how logical inferences can be implemented using bit-encoded data..
Prolog vs LLMs: A Complementary Approach to AI (according to DeepSeek)

Prolog can still remain useful in today’s AI landscape, even with the rise of large language models (LLMs) like GPT, Gemini, and others. While LLMs excel at natural language understanding, generation, and pattern recognition, Prolog offers unique strengths in symbolic reasoning, rule-based systems, and logical inference. Here’s how Prolog can complement LLM-based AI
PapaGEN 1.05: Political Blather Text Generator (Γεννήτρια Παπάτζας)

Γεννήτρια Παπάτζας για προσομοίωση ιδεοληψιών (Prolog & Assembly software video demo)
Ultra-Fast Hybrid Genetic Algorithm in Assembly Language for the Travelling Salesman Problem (DLL for LPA Prolog)

Traveling Salesman Problem (TSP) solved by a “Hybrid Genetic Algorithm” I had developed in Assembly Language and LPA Prolog.
Assembly Language for Visual Prolog Meta-programming

(This is an experimental repost – for testing purposes, using Scribefire. Original post is here).
Assembly Language for Visual Prolog Meta-programming

Image via Wikipedia Back in 2005, while working in large-scale programming projects for data-mining in G.I.S. and Hydrology, I wrote a Prolog interpreter called “G.I.S. Prolog“, equipped with many extra predicates (such as functions to locate points inside polygons, etc).The G.I.S. Prolog interpreter was originally based on the “PIE interpreter” (included as free source-code in…
DreamProver: A visual theorem prover for “Multiple Form Logic” (etc.) in LPA Win-Prolog 4.6

Image via Wikipedia Visual DreamProver 1.0 is a new theorem-proving program, developed in LPA Win-Prolog 4.6, with multi-coloured graphics displays of (potentially unlimited) Logic expressions, theorem proofs and deductions in Multiple Form Logic, in the primary algebra of “Laws of Form“, in Boolean Algebra and in a variety of other logic systems (to a large…
reading/writing/sorting Prolog variables, using the original variable-names (LPA Prolog code)

Typically, Prolog variables are assigned by the compiler “internal names”, so that it is impossible to sort them using their original names (those provided by the user or by an input file). However, in LPA Win-Prolog it is possible to preserve the original variable names, as well as sort them on the basis of these…