Hi everyone! I’m Sean, and I think Prolog is really cool. I am helping to make a deductive database and think Prolog is a great tool for the job. I have an unusual requirement, though. I don’t just need to be able to query facts, but also query for the deduction path Prolog took to get to a fact. S…

Hi all — first post here, thanks for having me :slight_smile: @Sean, I had exactly the same need recently and ended up building prolog-trace-viz ( https://www.npmjs.com/package/prolog-trace-viz ) for it. Might be worth a look. Prolog has been a bit of a rediscovery for me lately — genuinely loving i…

[image] jan: ? You generate a program. Yes, but how? The reason I want to avoid infinite recursion is so that I can “generate” a program to begin with. “Generate” is really not the right terminology. You can generate a program by starting with an empty clause and then adding one literal at a…

[image] Johnny_Rotten: and even compressed into a local LLM through some neural network technology, and run it on an AI Laptop, Yeah, my intended playbook looks like sleeping with the enemy. [image] jan: I consider that a dubious statement. Prolog inference is logically correct (within…

[image] jan: That is not so clear. I once asked ChatGPT to do some formalization of natural language and it spontaneously suggested to use Prolog for that. Could of course be because I chatted before about Prolog. On the other hand, I mostly used (used as I switched to Claude since) it for C and…

[image] stassa.p: Inductive Logic Programming at 30 Stephen H. Muggleton et al. - 2022 https://link.springer.com/article/10.1007/s10994-021-06089-1 Well this was published a few years ago, before the AI boom. It had already a section 7 Technologies - 7.2 Neural networks, but saying its li…

[image] jan: ? You generate a program. Next, you compute the call graph for that program and you find the longest cycle as well as the longest non-cyclic call chain. Now, for each test you set the depth limit to InputTokens * CycleLength + CallChainLength + SomeSafety. Of course, this is overhe…

[image] stassa.p: ?- learn(ancestor/2). ancestor(A,B):-parent(A,B). ancestor(A,B):-ancestor(A,C),ancestor(C,B). true. What happens if we switch the flag that fetches clauses from Subs and turn tabling off? ?- learn(ancestor/2). ancestor(A,B):-parent(A,B). ancestor(A,B):-parent(A,C),ancestor(C,…

[image] Johnny_Rotten: Neither can ILP. It depends on what you mean by “ILP”. The approach I discuss above, Meta-Interpretive Learning (abbreviated as MIL) is really a second-order form of SLD-Resolution. Note that I say “SLD” not “SLD(NF)”. No Negation As Failure! At least not in principle. …

Like I say above, this is a combination of the effect of the argument K which limits the number of clauses in a hypothesis, and the addition or not of the hypothesis itself to the set of clauses fetched during the proof. It’s not too easy to explain quickly but effectively what happens is that give…

[image] stassa.p: Importantly, we can also allow Resolution of H with ittself, which enables the learning of arbitrary recursion, including left-recursion. This is possible by switching to SLG-Resolution I just tried that, works like a charm, eh voila a left recursive rule, or even worse a…

Is there an easy way to view "stack traces" with the interpreter?

General

EricGT Split this topic April 11, 2026, 12:02pm 96

5 posts were split to a new topic: Temporary name

Topic		Replies	Views
Building a proof tree / collecting clauses in a refutation sequence Help!	33	2487	August 15, 2021
We have a segfault General	11	170	February 21, 2025
Help with tabling to avoid infinite left-recursion General	10	1106	December 20, 2019
Tabling the wolf, sheep, cabbage Help! tabling	24	2915	July 30, 2021
Changing results with tabling General	12	650	March 25, 2020

Is there an easy way to view "stack traces" with the interpreter?

Related topics