HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
stassa
louise
Prolog2019–2026
stassa / louise

louise

Polynomial-time Meta-Interpretive Learning

6Distinct people
25Mentions
1Explicit recommenders
137GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

Polynomial-time Meta-Interpretive Learning

GitHub

Where it is used

No documented product use has been verified yet.

What people are saying

Hey, if you're interested in higher-order logic programming then you might want to have a look at Meta-Interpretive Learning (MIL). It's a new approach to Inductive Logic…

YeGoblynQueenne used a recommendation phrase. One indexed comment matches. This is a phrase match, not a verdict.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 9–Nov 16 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/16/2026, 3:59:04 AM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by year25 dated mentions

Observed mentions: 2019-08-04 07:50:07 UTC to 2026-02-24 18:03:33 UTC.

02462019-01-01 00:00:00 UTC to 2020-01-01 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments20192020-01-01 00:00:00 UTC to 2021-01-01 00:00:00 UTC (exclusive): 3 mentions; 1 submissions, 2 comments2021-01-01 00:00:00 UTC to 2022-01-01 00:00:00 UTC (exclusive): 4 mentions; 0 submissions, 4 comments2022-01-01 00:00:00 UTC to 2023-01-01 00:00:00 UTC (exclusive): 3 mentions; 0 submissions, 3 comments20222023-01-01 00:00:00 UTC to 2024-01-01 00:00:00 UTC (exclusive): 6 mentions; 0 submissions, 6 comments2024-01-01 00:00:00 UTC to 2025-01-01 00:00:00 UTC (exclusive): 4 mentions; 0 submissions, 4 comments2025-01-01 00:00:00 UTC to 2026-01-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 comments2026-01-01 00:00:00 UTC to 2027-01-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 comments. Incomplete calendar period.2026*

* An incomplete calendar period is marked with an outlined bar. Its count is not directly comparable with a full period.

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
20192019-01-01 00:00:00 UTC2020-01-01 00:00:00 UTC101
20202020-01-01 00:00:00 UTC2021-01-01 00:00:00 UTC312
20212021-01-01 00:00:00 UTC2022-01-01 00:00:00 UTC404
20222022-01-01 00:00:00 UTC2023-01-01 00:00:00 UTC303
20232023-01-01 00:00:00 UTC2024-01-01 00:00:00 UTC606
20242024-01-01 00:00:00 UTC2025-01-01 00:00:00 UTC404
20252025-01-01 00:00:00 UTC2026-01-01 00:00:00 UTC202
2026 (partial)2026-01-01 00:00:00 UTC2027-01-01 00:00:00 UTC202

What Hacker News says

6 sources
Well, if you're willing to use Prolog I commend you, but then you don't need an LLM because you don't need to do a dumb search of a large space. You can instead use second-order Resolution for induction. Here's how it's done (a.k.a. shameless plug of my PhD work): https://github.com/stassa/louise/blob/master/data/examples/a... >> Disclaimer: did my dissertation on ips (with genetic programming), but in the 90s when we basically had no computer power. The results were horrible outside trivialities, now they aren't anymore. But that's because the training data and the model parameters keep increasing. Performance keeps increasing but not because capabilities improve, only because there's more and more resources spent on the same old problems. There's better ways than that. All the classical AI problems, planning, verification, SAT, now have
Read the rest
fast solutions thanks to better heuristics, not thanks to more data (that are useless to them anyway). That's a real advance. I still would like a quantification of the "vast trim" btw. Numbers, or it didn't happen.
In FunSearch: Making new discoveries in mathematical sciences using LLMs
YeGoblynQueenne·Feb 4, 2023Recommendation phrase
Hey, if you're interested in higher-order logic programming then you might want to have a look at Meta-Interpretive Learning (MIL). It's a new approach to Inductive Logic Programming (ILP) that learns by SLD-resolution with first- and second-order definite clauses (hence, "higher-order"). You won't find much on MIL as "higher-order logic programming" but that's really what it is: it's logic programming; with a higher-order program (i.e. one containing both first- and second-order clauses). The catch is that once you do this any proof you complete gives you instantiations into the second-order variables in the second-order clauses and now you have yourself a first-order program, that you didn't have before; hence "inductive". So it's basically a form of machine learning of logic programs, from other logic programs. There are a few papers y
Read the rest
ou can find online about MIL, but I recommend (PLUG ALERT) the documentation of the MIL system I created for my doctoral thesis as a starting point: https://github.com/stassa/louise I recommend that as a starting point because it's written for people who are familiar with logic programming, but not necessarily ILP. Anyway, plug over. I think MIL is an exciting new development that has of course gone under the radar of the logic programming community at large.
In Scryer Prolog
Regarding the Peano version of the Ackermann-Péter function, I checked again to make sure and I never used the word "elegant" anywhere, either on HN or on Rosetta Code. I would never be so presumptuous, you know? On Rosetta code I pointed out that my version is "pure" because that's what Prolog code without side-effects is usually called. I put it in "quotes" because I personally don't care about purity. What I care about is simplicity of structure. That's because the simpler the structure of a program, the easier the prorgam can be learned. You see, my PhD studies and my research interest are about writing Prolog programs that learn Prolog programs from Prolog programs and to do that it really helps if all the Prolog programs are veeery simple, for combinatorial explosion ever lurks. For example, I'm so delighted that I figured out how t
Read the rest
o write that "pure" version of the Ackermann-Péter function not because I'm so full of myself I think it's "elegant" but because it is simple, and thanks to its simplicity I could then get my ILP system, Louise, to learn it from a single example: https://github.com/stassa/louise/blob/master/data/examples/a... The is/2 version would be much harder to learn, because of the more complex structure. Although I think Louise can do that too. Btw, I got Louise to learn the Function because I was challenged to do it by one of the examiners in my viva, who figured the Function's furious combinatorial complexity makes it unlearnable. That's right, but Louise can get around that because it can learn recursive programs with arbitrary structure from a single example, so it doesn't have to be trained on any example that triggers the Function's combinatorial fury. In any case, Ackermann is a toy function only really useful to make a point about recursion, and that's exactly how I use it also. Who cares if it blows up with n = 2, m = 4, or with n = 5, m = 6? It blows up quickly anyway. That's the whole point. So, your comment above is very stream-of-consciousness and I wonder what motivated you to write such a mad rant of the internets. I guess you must be really passionate about the subject you discuss. If so, I understand. You are not alone :) No, really, I generally agree with you. I asked above what is "usefulness" because for me Prolog is useful and I don't understand why anyone would say it isn't. Reading your other comment in the thread, I got the impression you would agree with me on that. But it's not about agreement. Aye, the night is long and full of errors and we must somehow deal with the dirty, dirty real world. Personally, I'm happy with that. But I do like my tools to also be nice to look at and I find that when I can make them so, they also tend to work better. For example, cleaner, better commented code, is easier to read and maintain. I mean, duh. In any case, in my mind, a well-made tool is a thing of beauty anyway you look at it. Re: "quality of life", well yea, that. If you were to look at my Louise, I think you'd find that I've gone out of my way to make it into a system that people can used. I'm totally inspired to do that by SWI-Prolog, btw. So for example, Louise has logging facilities up the wazoo and so everytime someone tries to use it and it breaks, they send me a nice, friendly dump of their logs, and then I can trudge through them and help my user. Because I want to help my user. I wish people sent me more bug reports, but I guess the majority find that something breaks and they don't bother to tell me. Oh mon dieu, la cruelle tourmente. As another example, I spent considerable effort to make sure that Louise's "metarules" (second-order background knowledge) are easy to read and use. For that purpose there's three metarule formats that Louise's pretty-printer can produce. One is the internal representation of the metarule that's useful for debugging, one is the user-friendly format where metarules are declared at the user-level and a final one is the formal notation, with quantifiers, used in the literature, so users can directly relate the metarules they use to a paper they read. Here's what that looks like ("chain" is the friendly identifier of that particular metarule): ?- print_metarules(expanded, chain). m(chain,P,Q,R):-m(P,X,Y),m(Q,X,Z),m(R,Z,Y) true. ?- print_metarules(user_friendly, chain). configuration:chain metarule 'P(x,y):- Q(x,z),R(z,y)'. true. ?- print_metarules(quantified, chain). (Chain) ∃.P,Q,R ∀.x,y,z: P(x,y)← Q(x,z),R(z,y) true. By contrast, if you look at the original Meta-Interpretive Learning system, Metagol (https://github.com/metagol/metagol), this is what "chain" looks like: metarule([P,Q,R], [P,A,B], [[Q,A,C],[R,C,B]]). % chain If I understand your comments about "quality of life" work correctly, then that's pretty much what I always try to do and what most people in academia never do. Guess what, I'm out of the game now. But, well, at least I tried :)
In Prolog at Work
As triska says, there are different execution strategies for Prolog and left-recursion is not a problem in practice. To plug my own work, the Inductive Logic Programming (ILP) system I developed during my PhD (https://github.com/stassa/louise) can learn left-recursive Prolog programs thanks to an inductive Prolog meta-interpreter executed with SLG-resolution (a.k.a. tabling). I mean to say that the inductive meta-interpreter itself is tabled, so it can prove left-recursive programs without entering an infinite recursion (it needs to do that because it learns a program by proving its generalisation). And so it can learn left-recursive programs without "going infinite". That used to be a big problem for ILP, but it's now well and truly solved, in theory as well as in practice. And I say "now" but SLG-resolution is old as a a very old thing;
Read the rest
Tamaki and Sato described it in 1986, I believe: https://link.springer.com/chapter/10.1007/3-540-16492-8_66 But then implementations took a bit to catch up. >> Prolog is deeply unsuited for work, use Clingo instead. Well, that doesn't make sense. ASP doesn't even allow lists, let alone side-effects (you know, like writing to a stream), so what "work" is it that it's better suited for, than Prolog? Also, if I remember correctly, Clingo is not a language but a grounder? It takes a first-order program and grounds the entire Herbrand base into a set of propositions so that a SAT solver can then derive the stable models of the program? Do I have that wrong? Let me say up front that I've never heard a worse idea in my life, and I've heard a few. First of all, that's why ASP can't use lists, or other functions, because then the Herbrand base goes infinite and good luck grounding it. Second, SAT-solving is NP-complete. As I realised recently (https://news.ycombinator.com/item?id=34072923) ASP is an elegant framework for dealing with uncertainty in a purely symbolic manner, with negation as failure and axiomatic, classical negation. But then, why go and mess this elegance up with a dumb propositionalisation approach that loses all the good stuff about first order logic, and that's terminally inefficient to boot? That, I still don't get.
In Prolog at Work

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.