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…

[image] jan: Yes, but if you save a lot of runtime, you win anyway. Applying the heuristic to tabled clauses to try and get the recursive call as early as possible is probably worthwhile. Surely if your clauses are pure and thus swapping goals in the body as well as swapping clauses has no seman…

Can’t you get away with time and/or depth limit for your case? I.e., simply reject non-terminating programs and let the ILP system figure out terminating alternatives?

Yes, I do use depth-limits as an alternative to tabling, but that requires the user to set the depth limit since it’s not always going to be the same in fact it can vary wildly depending on the program we’re trying to learn. If the depth limit is too large the learned program doesn’t change but it t…

[image] stassa.p: Yes, I do use depth-limits as an alternative to tabling, but that requires the user to set the depth limit since it’s not always going to be the same in fact it can vary wildly depending on the program we’re trying to learn. If the depth limit is too large the learned program d…

[image] jan: I understand. I’d expect recursion to happen over recursive structures in the input you are trying to learn, no? If that is true, there is a simple upper limit: number of “tokens” in the input times longest recursive path through the call graph. In short, yes, but we can’t know t…

[image] jan: For curiosity, do people use LLMs to generate and debug candidate programs in the context of ILP these days? I haven’t seen that, specifically, I don’t think. I know people generate Prolog with LLMs and say that they do ILP, though. I’m not sure how to react to that, to be honest…

[image] anon37422618: [image] stassa.p: w set of definite clauses, call it H (for “hypothesis”) What about higher order hypothesis. For example the “notion left recursive” (L), could be a hypothesis, in the sense that somebody hypothesizes that this and that “relation” (R) is L: L(X, Y…

[image] stassa.p: In short, yes, but we can’t know the call graph before hand. ? 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 InputToke…

[image] anon37422618: Isn’t that just a SLD with a depth limit somehow. That was not my intend. It is intended as SLD with a protection that kills non-terminating SLD inference (assuming you check that the depth limit has been exceeded and you reject the program in that case). Time limit …

[image] anon37422618: The huge amount of resources available to an online LLM, and even compressed into a local LLM through some neural network technology, and run it on an AI Laptop, makes it very hard for Prolog to compete with LLMs. I consider that a dubious statement. Prolog inference i…

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

General

Topic		Replies	Views
Building a proof tree / collecting clauses in a refutation sequence Help!	33	2607	August 15, 2021
We have a segfault General	11	201	February 21, 2025
Help with tabling to avoid infinite left-recursion General	10	1129	December 20, 2019
Tabling the wolf, sheep, cabbage Help! tabling	23	2986	July 30, 2021
Can ILP learn geometry rules with floating point numbers General how-to	19	380	April 21, 2026

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

Related topics